A conditional logic approach for strengthening mixed 0-1 linear programs
From MaRDI portal
Recommendations
- Mixed logical-linear programming
- A conflict-directed approach to chance-constrained mixed logical linear programming
- A linearization method for mixed 0--1 polynomial programs
- A unified approach to mixed-integer optimization problems with logical constraints
- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
- scientific article; zbMATH DE number 1497345
- An enhanced logical benders approach for linear programs with complementarity constraints
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- A new approach to integrating mixed integer programming and constraint logic programming
- Strong formulations of robust mixed 0-1 programming
Cites work
- A class of facet producing graphs for vertex packing polyhedra
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A Note on Coefficient Adjustment Using Sos Constraints
- A note on exact algorithms for the bottleneck generalized assignment problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Efficient reformulation for 0-1 programs -- methods and computational results
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- Facets of the Knapsack Polytope From Minimal Covers
- Foundation-penalty cuts for mixed-integer programs.
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
- On tightening cover induced inequalities
- On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
Cited in
(12)- RLT insights into lift-and-project closures
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Linear forms of nonlinear expressions: new insights on old ideas
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- A note for tightening 0-1 models
- A conflict-directed approach to chance-constrained mixed logical linear programming
- Lifted formulations for the target visitation problem
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Logical processing for integer programming
- Coefficient strengthening: a tool for reformulating mixed-integer programs
This page was built for publication: A conditional logic approach for strengthening mixed 0-1 linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817194)
