Complexity Issues in Global Optimization: A Survey

This publication has 17 references indexed in Scilit:

• An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization Problems
  Published by World Scientific Pub Co Pte Ltd ,1993
• A continuous approach to inductive inference
  Mathematical Programming, 1992
• Quadratic programming with one negative eigenvalue is NP-hard
  Journal of Global Optimization, 1991
• An interior-point approach to NP-complete problems. I
  Contemporary Mathematics, 1990
• Some algebraic and geometric computations in PSPACE
  Published by Association for Computing Machinery (ACM) ,1988
• A faster PSPACE algorithm for deciding the existential theory of the reals
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• On the computational complexity of algorithms
  Transactions of the American Mathematical Society, 1965
• Maxima for Graphs and a New Proof of a Theorem of Turán
  Canadian Journal of Mathematics, 1965