Testing cut generators for mixed-integer linear programming
From MaRDI portal
(Redirected from Publication:734353)
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
Cites work
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 1956212 (Why is no real title available?)
- scientific article; zbMATH DE number 2079347 (Why is no real title available?)
- scientific article; zbMATH DE number 1516979 (Why is no real title available?)
- scientific article; zbMATH DE number 1857683 (Why is no real title available?)
- scientific article; zbMATH DE number 795579 (Why is no real title available?)
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Cutting planes in integer and mixed integer programming
- Exact solutions to linear programming problems
- Experimental analysis of algorithms
- Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Feature Article—Toward an Experimental Method for Algorithm Simulation
- Integer Programming and Pricing
- Local branching
- MIPLIB 2003
- Needed: An Empirical Science of Algorithms
- Network Reoptimization Algorithms: A Statistically Designed Comparison
- Numerically safe Gomory mixed-integer cuts
- Reduce-and-Split cuts: improving the performance of mixed-integer Gomory cuts
- Safe bounds in linear and mixed-integer linear programming
- Testing heuristics: We have it all wrong
- The final NETLIB-LP results
Cited in
(11)- Intersection cuts from multiple rows: a disjunctive programming approach
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Inverse integer optimization with an imperfect observation
- On the safety of Gomory cut generators
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming
- Multirow Intersection Cuts Based on the Infinity Norm
- Lexicography and degeneracy: Can a pure cutting plane algorithm work?
- Theoretical challenges towards cutting-plane selection
- A polyhedral approach for the equitable coloring problem
- A heuristic to generate rank-1 GMI cuts
- Lift-and-project cuts for mixed integer convex programs
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)
