Finding multiple solutions to general integer linear programs

European Journal of Operational Research

Volumn 184, Issue 2, 2008, Pages 802-809

  Tsai, Jung Fa ^a   Lin, Ming Hua ^b   Hu, Yi Chung ^c  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b SHIH CHIEN UNIVERSITY   (Taiwan)

^c CHUNG YUAN CHRISTIAN UNIVERSITY   (Taiwan)

Author keywords

General integer cut; Integer programming; Linearization; Multiple solutions

Indexed keywords

ALGORITHMS; DECISION MAKING; LINEAR PROGRAMMING; LINEARIZATION; NUMERICAL METHODS; PROBLEM SOLVING;

GENERAL INTEGER CUT; MULTIPLE SOLUTIONS; OBJECTIVE FUNCTION;

INTEGER PROGRAMMING;

EID: 34548494862     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.11.024     Document Type: Article

References (30)

1. Balas E., and Jeroslow R. Canonical cuts on the unit hypercube. SIAM Journal of Applied Mathematics 23 1 (1972) 61-69
2. Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., and Vance P.H. Branch-and-price: Column generation for solving huge integer programs. Operations Research 46 3 (1998) 316-329
3. Biegler L.T., and Grossmann I.E. Retrospective on optimization. Computers and Chemical Engineering 28 (2004) 1169-1192
4. Bixby, R.E., Ceria, S., McZeal C,M., Savelsbergh, M.W.P. 1998. An updated mixed integer programming library: MIPLIB 3.0. Technical Report TR98-03, The Department of Computational and Applied Mathematics, Rice University, Houston, TX.
5. Borchers B., and Mitchell J.E. An improved branch and bound algorithm for mixed integer nonlinear programs. Computers and Operations Research 21 4 (1994) 359-367
6. Caprara A., and Fischetti M. Branch-and-cut algorithms. In: Dell'Amico M., Maffioli F., and Martello S. (Eds). Annotated Bibliographies in Combinatorial Optimization (1997), J. Wiley & Sons, Chichester 45-64
7. Cardoso M.F., Salcedo R.L., and Feyo de Azevedo S. The simplex-simulated annealing approach to continuous nonlinear optimization. Computer and Chemical Engineering 20 (1996) 1065-1080
8. Dakin R.J. A tree search algorithm for mixed integer programming problems. The Computer Journal 8 (1965) 250-255
9. Djerdjour M. An enumerative algorithm framework for a class of nonlinear integer programming problems. European Journal of Operational Research 101 (1997) 104-121
10. Duran M., and Grossmann I.E. An outer-approximation algorithm for a class of mixed integer nonlinear programs. Mathematical Programming 36 (1986) 307-339
11. Fletcher R., and Leyffer S. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming 66 (1994) 327-349
12. Geoffrion A.M. Generalized Benders decomposition. Journal of Optimization Theory and Applications 10 (1972) 237-260
13. Grossmann I.E. Review of nonlinear mixed-integer and disjunctive programming techniques. Optimization and Engineering 3 (2002) 227-252
14. Grossmann I.E., and Biegler L.T. Future perspective on optimization. Computers and Chemical Engineering 28 (2004) 1193-1218
15. Johnson E.L., Nemhauser G.L., and Savelsbergh M.W.P. Progress in linear programming based branch-and-bound algorithms: An exposition. INFORMS Journal on Computing 12 (2000) 1-23
16. Leyffer S. Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Computational Optimization and Applications 18 (2001) 295-309
17. LINGO, 2004. Release 9.0. LINDO System Inc., Chicago.
18. Quesada I., and Grossmann I.E. An LP/NLP based branch and bound algorithm for convex minlp optimization problems. Computer and Chemical Engineering 16 (1992) 937-947
19. Rosen S.L., and Harmonosky C.M. An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. Computers and Operations Research 21 4 (2005) 359-367
20. Salcedo R.L., Goncalves M.J., and Feyo de Azevedo S. An improved random-search algorithm for nonlinear optimization. Computer and Chemical Engineering 14 (1990) 1111-1126
21. Salkin H.M., and Mathur K. Foundations of Integer Programming (1989), North-Holland, Amsterdam
22. Simons, R. 1996. How OR Improved Smelter Performance. MP in Action. The Newsletter of Mathematical Programming in Industry and Commerce, United Kingdom, February.
23. Stubbs R.A., and Mehrotra S. A branch-and-cut method for 0-1 mixed convex programming. Mathematical Programming 86 (1999) 515-532
24. Taha H.A. Operations Research. Seventh ed (2003), Macmillan, New York
25. Tawarmalani M., and Sahinidis N.V. Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming: Theory, Algorithms, Software, and Applications (2002), Kluwer Academic Publishers, Dordrecht
26. Wang H.F., and Liao Y.C. A hybrid approach to resolving a differentiable integer program. Computers and Operations Research 25 6 (1998) 505-517
27. Westerlund T., and Pettersson F. An extended cutting plane method for solving convex MINLP problems. Computer and Chemical Engineering 19 (1995) S131-S136
28. Westerlund T., and Pörn R. Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optimization and Engineering 3 (2002) 235-280
29. Xiong Y., and Rao S.S. Fuzzy nonlinear programming for mixed-discrete design optimization through hybrid genetic algorithm. Fuzzy Sets and Systems 146 (2004) 167-186
30. Zionts S. Linear and Integer Programming (1974), Prentice-Hall, New Jersey