A new lift-and-project operator
From MaRDI portal
Publication:1752818
DOI10.1016/j.ejor.2016.07.057zbMath1394.90433OpenAlexW2497949436MaRDI QIDQ1752818
Merve Bodur, Sanjeeb Dash, Oktay Günlük
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.057
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Strong lift-and-project cutting planes for the stable set problem
- Using symmetry to optimize over the Sherali-Adams relaxation
- Projection, lifting and extended formulation integer and combinatorial optimization
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem
- Chvátal closures for mixed integer programming problems
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- On the Matrix-Cut Rank of Polyhedra
- Integer Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational Experience with Stable Set Relaxations
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
