Generating multiple solutions for mixed integer programming problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 280-294

  Danna, Emilie ^a   Fenelon, Mary ^a   Zonghao, Gu ^a   Wunderling, Roland ^a  

^a ILOG Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

BUSINESS PROBLEMS; INTEGER PROGRAMMING PROBLEMS; NEAR-OPTIMAL SOLUTIONS;

INTEGER PROGRAMMING;

EID: 38049068912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_22     Document Type: Conference Paper

References (22)

1. Tian Sang, Fahiem Bacchus, Paul Beame, Henry Kautz, and Toniann Pitassi. Combining Component Caching and Clause Learning for Effective Model Counting, SAT 2004.
2. Egon Balas, Anuret Saxena. Optimizing over the split closure, Technical Report 2006-E5, Tepper School of Business, CMU, 2005.
3. Robert E. Bixby, Mary Fenelon, Zonghao Gu, Edward Rothberg, and Roland Wunderling. MIP: Theory and practice - closing the gap. In M. J. D. Powell and S. Scholtes (eds.), System Modelling and Optimization: Methods, Theory, and Applications, pages 19-49. Kluwer Academic Publishers, 2000.
4. Robert E. Bixby, S. Ceria, C. M. McZeal, M. W. P Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0. Journal Optima: 58, 12-15, 1998.
5. William Cook, Ricardo Fukasawa, and Marcos Goycoolea. Choosing the best cuts. Workshop on mixed integer programming, MIP 2006.
6. CPLEX 10.0 Manual, Hog Inc., 2006.
7. Emilie Danna, Edward Rothberg, Claude Le Pape. Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming: 102(1), 7190, 2005.
8. Sanjeeb Dash, Oktay Günlük, and Andrea Lodi. Separating from the MIR closure of polyhedra. Workshop on mixed integer programming, MIP 2006.
9. Matteo Fischetti, Andrea Lodi. Optimizing over the first Chvátal closure, in M. Jünger and V. Kaibel (eds.), Integer Programming and Combinatorial Optimization - IPCO 2005, LNCS 3509, Springer-Verlag, 12-22, 2005.
10. Matteo Fischetti, Andrea Lodi. MIP models for MIP separation. Workshop on mixed integer programming, MIP 2006.
11. Fred Glover, Arne Løkketangen, and David L. Woodruff. Scatter search to generate diverse MIP solutions. In OR computing tools for modeling, optimization and simulation: interfaces in computer science and operations research, M. Laguna and J.L. Gonzalez-Velarde (eds.), Kluwer Academic Publishers, 299-317, 2000.
12. Peter Greistorfer, Arne Løkketangen, Stephan Voß, and David L. Woodruff. Experiments concerning sequential versus simultaneous maximization of objective function and distance. Submitted to Journal of Heuristics, 2006.
13. Karla Hoffman and Manfred Padberg. Improving Representations of Zero-one Linear Programs for Branch-and-Cut, ORSA Journal of Computings, 121-134, 1991.
14. Miroslav Karamanov and Gerard Cornuejols. Cutting Planes Selection. Workshop on mixed integer programming, MIP 2006.
15. Sangbum Lee, Chan Phalakornkule, Michael M. Domach, and Ignacio E. Grossmann. Recursive MILP model for finding all the alternate optima in LP models for metabolic networks. Computers and Chemical Engineering, 24:711-716, 2000.
16. MIPLIB 2003, http://miplib.zib.de/
17. Edward Rothberg. It's a beautiful day in the neighborhood -Local search in mixed integer programming. Workshop on mixed integer programming, MIP 2005.
18. Edward Rothberg. An evolutionary algorithm for polishing mixed integer programming solutions. To appear in INFORMS Journal on Computing.
19. Patrick Schittekat and Kenneth Sorensen. Coping with unquantifiable criteria by generating structurally different solutions - Applications to a large real-life location-routing problem in the automative industry. ISMP 2006.
20. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
21. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 9:410-421, 1979.
22. Laurence A. Wolsey, Integer Programming, Wiley, New York, 1998.