A new lift-and-project operator

DOI10.1016/J.EJOR.2016.07.057MaRDI QIDQ1752818zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

cutting planesextended formulationsinteger programminglift-and-project

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Strong lift-and-project cutting planes for the stable set problem
• A comprehensive analysis of polyhedral lift-and-project methods
• Lift-and-project for mixed 0-1 programming: recent progress
• A modified lift-and-project procedure
• An application of the Lovász-Schrijver M(K, K) operator to the stable set problem

Cites work

• A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
• Chvátal closures for mixed integer programming problems
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Computational Experience with Stable Set Relaxations
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
• scientific article; zbMATH DE number 1757962 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• Integer Programming
• On the matrix-cut rank of polyhedra.
• Projection, lifting and extended formulation integer and combinatorial optimization
• Semidefinite programming relaxations for graph coloring and maximal clique problems
• Solving Lift-and-Project Relaxations of Binary Integer Programs
• Strengthened benders cuts for stochastic integer programs with continuous recourse
• Strong lift-and-project cutting planes for the stable set problem
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
• Using symmetry to optimize over the Sherali-Adams relaxation

Cited in

(4)

• Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators
• A New Genuine Durrmeyer Operator
• scientific article; zbMATH DE number 1204321 (Why is no real title available?)
• Application of the Lovász-Schrijver operator to compact stable set integer programs

Describes a project that uses

Uses Software

• MIPLIB

This page was built for publication: A new lift-and-project operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752818)