Complexity Issues in Global Optimization: A Survey
- 1 January 1995
- book chapter
- other
- Published by Springer Science and Business Media LLC in Nonconvex Optimization and Its Applications
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An O(nL) Iteration Algorithm for Computing Bounds in Quadratic Optimization ProblemsPublished by World Scientific Pub Co Pte Ltd ,1993
- A continuous approach to inductive inferenceMathematical Programming, 1992
- Quadratic programming with one negative eigenvalue is NP-hardJournal of Global Optimization, 1991
- An interior-point approach to NP-complete problems. IContemporary Mathematics, 1990
- Some algebraic and geometric computations in PSPACEPublished by Association for Computing Machinery (ACM) ,1988
- A faster PSPACE algorithm for deciding the existential theory of the realsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Maxima for Graphs and a New Proof of a Theorem of TuránCanadian Journal of Mathematics, 1965