A conditional logic approach for strengthening mixed 0-1 linear programs
From MaRDI portal
Publication:817194
DOI10.1007/s10479-005-3452-zzbMath1091.90057OpenAlexW1998160034MaRDI QIDQ817194
Robin Lougee-Heimer, Warren P. Adams
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3452-z
Related Items
A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs, Coefficient strengthening: a tool for reformulating mixed-integer programs, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions, Linear forms of nonlinear expressions: new insights on old ideas, RLT insights into lift-and-project closures, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, Logical processing for integer programming
Cites Work
- Unnamed Item
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- On tightening cover induced inequalities
- A class of facet producing graphs for vertex packing polyhedra
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A note on exact algorithms for the bottleneck generalized assignment problem
- Foundation-penalty cuts for mixed-integer programs.
- Efficient reformulation for 0-1 programs -- methods and computational results
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Note on Coefficient Adjustment Using Sos Constraints
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Facets of the Knapsack Polytope From Minimal Covers
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
