Christos H. Papadimitriou
- 1 BOROSH, i, AND TREYBIG, L B.Bounds on posmve integral sohuons to hnear Dlophantlne equauons. Proc Amer Math Soc 55 (1976), 299-304Google Scholar
- 2 COOK, S A Private communication, 1978Google Scholar
- 3 DANTZIG, G B Linear Programmmg and Extenswns Princeton Umverslty Press, Princeton, N J, 1962Google Scholar
- 4 GAREY, M.R, AND JOHNSON, D S 'Strong" NP-completeness results mouvatlon, examples, and implicatlons ~ ACM 25, 3 (July 1978), 499-508. Google Scholar
- 5 GAREY, M.R, AND JOHNSON, D S Computers and Intractabthty A Gude to the Theory of NP- completeness Freeman, San Francisco, 1979 Google Scholar
- 6 KANNAN, R, AND MONMA, C.L. On the computaUonal complexity of integer programmmg problems In Lecture Notes tn Economlcs and Mathematical Systems, Vol 157, Sprmger-Verlag, 1978, pp 161-172Google Scholar
- 7 KARP, R M. Reducihhty among combmatorial problems In Complexay of Computer Computattons, R E. Miller and J W Thatcher, Eds, Plenum, New York, 1972, pp 85-103.Google Scholar
- 8 PAPADIMITRIOU, C H, AND STEIGLITZ, K Combmatonal Opttmuatlon Algorithms and Complextty Prentice-Hall, Englewood Chffs, N J, 1981 Google Scholar
Index Terms
- On the complexity of integer programming
Recommendations
Mixed-integer quadratic programming
This paper considers mixed-integer quadratic programs in which the objective function is quadratic in the integer and in the continuous variables, and the constraints are linear in the variables of both types. The generalized Benders' decomposition is a ...
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method
In this paper, we propose a convergent Lagrangian and objective level cut method for computing exact solution to two classes of nonlinear integer programming problems: separable nonlinear integer programming and polynomial zero-one programming. The ...
Comments