Lift-and-project methods for set cover and knapsack (Q1799231): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comprehensive Analysis of Polyhedral Lift-and-Project Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding Semidefinite Programming Hierarchies via Global Correlation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercontractivity, sum-of-squares proofs, and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lift-and-Project Methods for Set Cover and Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time approximation of weighted set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / 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: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / 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: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank

Revision as of 23:08, 16 July 2024

scientific article
Language Label Description Also known as
English
Lift-and-project methods for set cover and knapsack
scientific article

    Statements

    Lift-and-project methods for set cover and knapsack (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2018
    0 references
    set cover
    0 references
    sub-exponential algorithms
    0 references
    approximation algorithms
    0 references
    lift-and-project methods
    0 references
    knapsack
    0 references
    0 references
    0 references

    Identifiers