Linear programming hierarchies collapse under symmetry
From MaRDI portal
Cites work
- A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A computational comparison of symmetry handling methods for mixed integer programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A nearly tight sum-of-squares lower bound for the planted clique problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A unified framework for symmetry handling
- Approximate fixed-rank closures of covering problems
- Automorphisms of Steiner Triple Systems
- Breaking symmetries to rescue sum of squares in the case of makespan scheduling
- Complexity of Positivstellensatz proofs for the knapsack
- Computational invariant theory
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Expressing combinatorial optimization problems by linear programs
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- Integrality gaps of 2-o(1) for vertex cover SDPs in the Lovász-Schrijver hierarchy
- Integrality gaps of linear and semi-definite programming relaxations for knapsack
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- On Polyhedral Approximations of the Second-Order Cone
- On the matrix-cut rank of polyhedra.
- Semialgebraic Proofs and Efficient Algorithm Design
- Semidefinite and linear programming integrality gaps for scheduling identical machines
- Sherali-Adams relaxations of the matching polytope
- Solving hard set covering problems
- Solving large Steiner Triple Covering Problems
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- Sum-of-squares Lower Bounds for Planted Clique
- Sum-of-squares rank upper bounds for matching problems
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in integer linear programming
- Using symmetry to optimize over the Sherali-Adams relaxation
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
This page was built for publication: Linear programming hierarchies collapse under symmetry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349478)
