A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (Q3452846): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2278496192 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.08644 / 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: Q4952606 / 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: On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy / 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: Sum-of-squares Lower Bounds for Planted Clique / 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: 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

Latest revision as of 03:15, 11 July 2024

scientific article
Language Label Description Also known as
English
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem
scientific article

    Statements

    A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references