RLT insights into lift-and-project closures
From MaRDI portal
Publication:2257076
DOI10.1007/s11590-014-0763-5zbMath1338.90271OpenAlexW2074905795MaRDI QIDQ2257076
Hanif D. Sherali, Warren P. Adams
Publication date: 23 February 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0763-5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Mixed-integer bilinear programming problems
- A conditional logic approach for strengthening mixed 0-1 linear programs
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- On the quadratic assignment problem
- A class of facet producing graphs for vertex packing polyhedra
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Tighter representations for set partitioning problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Exact MAX-2SAT solution via lift-and-project closure
- Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- The Quadratic Assignment Problem
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Assignment Problems and the Location of Economic Activities
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- L’algebre de Boole et ses applications en recherche operationnelle
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Numerical investigations on quadratic assignment problems
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Elementary closures for integer programs.
