An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (Q1683679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Geometry of Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of Squares Lower Bounds from Pairwise Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the Lasserre Ranks of Some Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Positivstellensatz proofs for the knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares hierarchy lower bounds for symmetric formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares Lower Bounds for Planted Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank

Revision as of 19:12, 14 July 2024

scientific article
Language Label Description Also known as
English
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
scientific article

    Statements

    An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2017
    0 references
    sum-of-squares hierarchy
    0 references
    integrality gap
    0 references
    min-number of late jobs
    0 references
    0 references
    0 references

    Identifiers