Coefficient strengthening: a tool for reformulating mixed-integer programs
From MaRDI portal
Publication:847848
DOI10.1007/S10107-008-0243-8zbMATH Open1184.90111OpenAlexW2146669290MaRDI QIDQ847848FDOQ847848
Authors: K. H. Andersen, Yves Pochet 
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0243-8
Recommendations
Cites Work
- Title not available (Why is that?)
- Solving Large-Scale Zero-One Linear Programming Problems
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Presolving in linear programming
- Title not available (Why is that?)
- Finding duplicate rows in a linear programming model
- Efficient reformulation for 0-1 programs -- methods and computational results
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- Coefficient reduction for inequalities in 0–1 variables
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
- A conditional logic approach for strengthening mixed 0-1 linear programs
Cited In (10)
- Applying a modified coefficient reduction method to a dynamic production scheduling model
- Generalized coefficient strengthening cuts for mixed integer programming
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management
- A new approach to the stable set problem based on ellipsoids
- Lattice based extended formulations for integer linear equality systems
- Strong IP formulations need large coefficients
- A Note on Coefficient Adjustment Using Sos Constraints
- Stronger formulations of mixed integer linear programs: an example
- Domain reduction techniques for global NLP and MINLP optimization
- Strengthening Chvátal-Gomory cuts for the stable set problem
Uses Software
This page was built for publication: Coefficient strengthening: a tool for reformulating mixed-integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847848)
