Combinatorial Benders' cuts

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

Volumn 3064, Issue , 2004, Pages 178-195

  Codato, Gianni ^a   Fischetti, Matteo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

Benders' Decomposition; Branch and Cut; Computational Analysis; Mixed Integer Programs

Indexed keywords

COMBINATORIAL OPTIMIZATION; INDUCTIVE LOGIC PROGRAMMING (ILP); LINEAR PROGRAMMING; LINEAR SYSTEMS;

BRANCH AND CUT; COMPUTATIONAL ANALYSIS; COMPUTATIONAL RESULTS; CONTINUOUS VARIABLES; LOGICAL IMPLICATIONS; MIXED-INTEGER PROGRAMS; ORDERS OF MAGNITUDE; PROBLEM REFORMULATIONS;

INTEGER PROGRAMMING;

EID: 35048844632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_14     Document Type: Article

References (19)

1. E. Amaldi, M.E. Pfetsch and L.E. Trotter, "On the Maximum Feasible Subsystem Problem, HSs and HS-Hypergraphs", Mathematical Programming 95, 3, 533-554, 2003.
2. G. Andreello, A. Caprara, M. Fischetti, "Embedding Cuts within a Branch & Cut Framework: a Computational Study with {0, 1/2}-cuts", Technical Report, DEI, University of Padova, 2003.
3. J. F. Benders, "Partitioning Procedures for Solving Mixed Variables Programming Problems", Numerische Mathematik 4, 238-252, 1962.
4. R. E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, R. Wunderling, "MIP: Theory and Practice-Closing the Gap", available at www.ilog.com/products/ optimization/tech/research/mip.pdf.
5. A. Caprara, M. Fischetti, "{0,3}- Chvatal-Gomory Cuts", Mathematical Programming 74, 221-235, 1996.
6. J. Chinneck, "Fast Heuristics for the Maximum Feasible Subsystem Problem", INFORMS J. Comput. 13 (3), 210-223, 2001.
7. V. Chvátal, "Resolution Search", Discrete Applied Mathematis 73, 81-99, 1997.
8. G. Codato, "A Combinatorial Approach to Benders' Decomposition", Tesi di Laurea, University of Padova, 2003 (in italian).
9. G. Codato, M. Fischetti "Combinatorial Benders' Cuts", full paper available at www.dei.unip.it/~fisch/cbc.pdf
10. J. Gleesonand and J. Ryan, "Identifying Minimally Infeasible Subsystems of Inequalities", ORSA Journal on Computing 2 (1), 61-63, 1990.
11. F. Glover and L. Tangedhal, "Dynamic Strategies for Branch and Bound", Omega 4 (5), 571-576, 1976.
12. J.N. Hooker, G. Ottosson, "Logic-based Benders Decomposition", Mathematical Programming, Mathematical Programming, 96, 33-60, 2003.
13. ILOG Cplex 8.1: User's Manual and Reference Manual, ILOG, S.A., http://www.ilog.com/, 2003.
14. ILOG Concert Technology 1.2: User's Manual and Reference Manual, ILOG, S.A., http://www.ilog.com/, 2003.
15. G. W. Klau, P. Mützel, "Optimal Labelling of Point Features in Rectangular Labelling Models", Mathematical Programming Ser. B, vol. 94 (2-3), 435-458, 2003.
16. M. Parker, J. Ryan, "Finding the Minimum Weight HS Cover of an Infeasible System of Linear Inequalities", Ann. Math. Artificial Intelligence 17,107-126,1996.
17. P.A. Rubin, "Solving Mixed Integer Classification Problem by Decomposition", Annals of Operations Research 74, 51-64, 1997.
18. E.S. Thorsteinsson, "Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming", Seventh International Conference on Principles and Practice of Constraint Programming (CP2001), 2001.
19. P.M. .Murphy, D. W. Aha, "UCI Repository of Machine Learning Databases", University of California, Department of Information and Computer Science, Irvine, CA, 1994; available at http://www.ics.uci.edu/~mlearn/ MLRepository.html