On the polyhedral lift-and-project methods and the fractional stable set polytope
From MaRDI portal
Publication:1015326
DOI10.1016/j.disopt.2008.10.002zbMath1166.90358MaRDI QIDQ1015326
Yu Hin (Gary) Au, Tunçel, Levent
Publication date: 7 May 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.10.002
90C10: Integer programming
90C27: Combinatorial optimization
47D99: Groups and semigroups of linear operators, their generalizations and applications
Related Items
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs, On the facets of lift-and-project relaxations under graph operations, Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope, On the facets of the lift-and-project relaxations of graph subdivisions
Cites Work
- Valid inequalities for mixed integer linear programs
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Lift and project relaxations for the matching and related polytopes
- The stable set problem and the lift-and-project ranks of graphs
- Tighter representations for set partitioning problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Tree-width and the Sherali-Adams operator
- On a Representation of the Matching Polytope Via Semidefinite Liftings
- On the Matrix-Cut Rank of Polyhedra
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Elementary closures for integer programs.
