Theory and methodologyAn approximate algorithm for nonlinear integer programming
References (12)
- et al.
Heuristic methods and applications: A categorized survey
European Journal of Operational Research
(1989) Integer solution of systems of quadratic equations
- et al.
Nonlinear integer programming and discrete optimization
Transactions of the ASME
(1983) - et al.
Branch and bound experiments in convex nonlinear integer programming
Management Science
(1985) Convexity and algorithmic complexity of polinomial programming problems solving
Izvestiya Academy of Sciences USSR. Technical Cybernetics
(1982)There cannot be any algorithm for integer programming with quadratic constraints
Operations Research
(1973)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 1994 Published by Elsevier B.V.