The following pages link to (Q2934582):
Displaying 28 items.
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Semidefinite and linear programming integrality gaps for scheduling identical machines (Q1800998) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs (Q2784422) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines (Q3186499) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- (Q5005186) (← links)
- Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
- (Q5091238) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- (Q5158503) (← links)
- No Small Linear Program Approximates Vertex Cover Within a Factor 2 − <i>ɛ</i> (Q5219712) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- (Q5743407) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
