Coefficient strengthening: a tool for reformulating mixed-integer programs
From MaRDI portal
Publication:847848
DOI10.1007/s10107-008-0243-8zbMath1184.90111OpenAlexW2146669290MaRDI QIDQ847848
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
Related Items (5)
Lattice based extended formulations for integer linear equality systems ⋮ On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ A New Approach to the Stable Set Problem Based on Ellipsoids ⋮ Strengthening Chvátal-Gomory Cuts for the Stable Set Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A conditional logic approach for strengthening mixed 0-1 linear programs
- Finding duplicate rows in a linear programming model
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- Efficient reformulation for 0-1 programs -- methods and computational results
- Presolving in linear programming
- Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study
- Solving Large-Scale Zero-One Linear Programming Problems
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Coefficient reduction for inequalities in 0–1 variables
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Stronger Inequalities for 0, 1 Integer Programming Using Knapsack Functions
This page was built for publication: Coefficient strengthening: a tool for reformulating mixed-integer programs
