RLT insights into lift-and-project closures
From MaRDI portal
(Redirected from RLT insights into lift-and-project closures)
Recommendations
- scientific article; zbMATH DE number 1302175
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cites work
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
- A class of facet producing graphs for vertex packing polyhedra
- A conditional logic approach for strengthening mixed 0-1 linear programs
- 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 level-2 reformulation-linearization technique bound for the quadratic assignment problem
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Assignment Problems and the Location of Economic Activities
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Elementary closures for integer programs.
- Exact MAX-2SAT solution via lift-and-project closure
- Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems
- scientific article; zbMATH DE number 3644805 (Why is no real title available?)
- scientific article; zbMATH DE number 3152649 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- L’algebre de Boole et ses applications en recherche operationnelle
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Mixed-integer bilinear programming problems
- Numerical investigations on quadratic assignment problems
- On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
- On the quadratic assignment problem
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The quadratic assignment problem
- Tighter representations for set partitioning problems
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
Cited in
(6)- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- Surrogate-RLT cuts for zero-one integer programs
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
- Efficient separation of RLT cuts for implicit and explicit bilinear products
This page was built for publication: RLT insights into lift-and-project closures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257076)
