Testing cut generators for mixed-integer linear programming

DOI10.1007/s12532-009-0003-7zbMath1171.90478OpenAlexW2011167315MaRDI QIDQ734353

Margot, François

Publication date: 20 October 2009

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-009-0003-7

Mathematics Subject Classification ID

Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Theoretical challenges towards cutting-plane selection, A review of computation of mathematically rigorous bounds on optima of linear programs, Multirow Intersection Cuts Based on the Infinity Norm, Inverse integer optimization with an imperfect observation, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, A heuristic to generate rank-1 GMI cuts, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Intersection cuts from multiple rows: a disjunctive programming approach, A polyhedral approach for the equitable coloring problem, Lift-and-Project Cuts for Mixed Integer Convex Programs, On the safety of Gomory cut generators

Uses Software

• R
• MIPLIB
• CPLEX
• COIN-OR
• MIPLIB2003

Cites Work

• Cutting planes in integer and mixed integer programming
• The final NETLIB-LP results
• Local branching
• Safe bounds in linear and mixed-integer linear programming
• Exploring relaxation induced neighborhoods to improve MIP solutions
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Testing heuristics: We have it all wrong
• MIPLIB 2003
• Exact solutions to linear programming problems
• Numerically Safe Gomory Mixed-Integer Cuts
• Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts
• Integer Programming and Pricing
• Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines
• Network Reoptimization Algorithms: A Statistically Designed Comparison
• Needed: An Empirical Science of Algorithms
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item