Testing cut generators for mixed-integer linear programming
DOI10.1007/S12532-009-0003-7zbMATH Open1171.90478OpenAlexW2011167315MaRDI QIDQ734353FDOQ734353
Authors: François Margot 
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
Recommendations
- Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
- An optimality cut for mixed integer linear programs
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Decomposition and dynamic cut generation in integer linear programming
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Generating cutting planes for mixed integer programming problems in a parallel computing environment
- Cuts for Conic Mixed-Integer Programming
- A cutting plane theory for mixed integer optimization
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- On Generating Test Problems for Nonlinear Programming Algorithms
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- MIPLIB 2003
- Testing heuristics: We have it all wrong
- Local branching
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Numerically safe Gomory mixed-integer cuts
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- The final NETLIB-LP results
- Title not available (Why is that?)
- Safe bounds in linear and mixed-integer linear programming
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Integer Programming and Pricing
- Needed: An Empirical Science of Algorithms
- Title not available (Why is that?)
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Cutting planes in integer and mixed integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact solutions to linear programming problems
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- Network Reoptimization Algorithms: A Statistically Designed Comparison
- Experimental analysis of algorithms
- Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- A polyhedral approach for the equitable coloring problem
- Lift-and-project cuts for mixed integer convex programs
- Theoretical challenges towards cutting-plane selection
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Multirow Intersection Cuts Based on the Infinity Norm
- On the safety of Gomory cut generators
- A heuristic to generate rank-1 GMI cuts
- Inverse integer optimization with an imperfect observation
- Intersection cuts from multiple rows: a disjunctive programming approach
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
Uses Software
This page was built for publication: Testing cut generators for mixed-integer linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734353)
