A branch-and-cut method for 0-1 mixed convex programming

Mathematical Programming, Series B

Volumn 86, Issue 3, 1999, Pages 515-532

  Stubbs, Robert A ^a   Mehrotra, Sanjay ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Convex programming; Mixed integer programming

Indexed keywords

EID: 0001367989     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050103     Document Type: Article

References (21)

1. Adams, W.P., Sherali, H.D. (1990): Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 38, 217-226
2. Balas, E., Ceria, S., Cornuéjols, G. (1993): A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295-324
3. Balas, E., Ceria, S., Cornuéjols, G. (1996): Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Manage. Sci. 42, 1229-1246
4. Bazaraa, M.S., Sherali, H.D., Shetty, C.M. (1993): Nonlinear Programming: Theory and Algorithms, second edition. John Wiley & Sons
5. Duran, M.A. (1984): A Mixed-Integer Nonlinear Programming Approach for the Systematic Synthesis of Engineering Systems. PhD thesis, Carnegie-Mellon University, December 1984
6. Duran, M.A., Grossmann, I.E. (1986): An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307-339
7. Floudas, C.A. (1995): Nonlinear and Mixed Integer Optimization: Fundamentals and Applications. Oxford University Press
8. Geoffrion, A.M. (1972): Generalized benders decomposition. J. Optim. Theory Appl. 10, 237-260
9. Hansen, P., Jaumard, B., Mathon, V. (1993): Constrained nonlinear 0-1 programming. ORSA J. Comput. 5, 97-119
10. Hiriart-Urruty, J-B., Lemaréchal C. (1993): Convex Analysis and Minimization Algorithm-I, vol. 305. Springer
11. Kocis, G.R., Grossmann, I.E. (1987): Relaxation strategry for the structural optimization of process flow sheets. Ind. Eng. Chem. Res. 26, 1868-1880
12. Lovász, L., Schrijver, A. (1991): Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190
13. Murtagh, B.A., Saunders, M.A. (1995): Minos 5.4 user's guide. Technical Report SOL 83-20R. Stanford University, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, California 94305-4022
14. Nemhauser, G.L. (1994): The age of optimization: Solving large-scale real-world problems. Oper. Res. 42, 5-13
15. Nemhauser, G.L., Wolsey, L.A. (1988): Integer and Combinatorial Optimization. John Wiley & Sons
16. Nesterov, Y., Nemirovskii, A. (1993): Interior-Point Polynomial Algorithms in Convex Programming. SIAM Stud. Appl. Math.
17. Noonan, F., Giglio, R.J. (1977): Planning electric power generation: A nonlinear mixed integer model employing benders decomposition. Manage. Sci. 23, 946-956
18. Padberg, M., Rinaldi, G. (1991): A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60-100
19. Perold, A.F. (1984): Large scale portfolio optimization. Manage. Sci. 30, 1143-1160
20. Sjerali, H.D., Adams, W.P. (1990): A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411-430
21. Sjerali, H.D., Adams, W.P. (1994): A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52, 83-106