Pages that link to "Item:Q2802523"

The following pages link to Convex Relaxations and Integrality Gaps (Q2802523):

Displaying 29 items.

• On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
• An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679) (← links)
• Lift-and-project methods for set cover and knapsack (Q1799231) (← 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)
• Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
• Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
• Breaking symmetries to rescue sum of squares in the case of makespan scheduling (Q2196315) (← links)
• A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
• New Tools for Graph Coloring (Q3088076) (← 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)
• Making the Long Code Shorter (Q3449561) (← links)
• A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846) (← links)
• On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
• Quasi-PTAS for scheduling with precedences using LP hierarchies (Q5002735) (← links)
• (Q5005186) (← links)
• Superlinear Integrality Gaps for the Minimum Majority Problem (Q5020845) (← links)
• (Q5075740) (← links)
• (Q5091238) (← links)
• Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• (Q5743407) (← links)
• Graphs with large girth and chromatic number are hard for Nullstellensatz (Q6573006) (← links)