The complexity of lifted inequalities for the knapsack problem (Q1201098): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q1166427 / rank
Normal rank
 
Property / author
 
Property / author: David B. Hartvigsen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers and packings in a family of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet of regular 0–1 polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting the facets of zero–one polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Computable Facets of the Knapsack Polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:00, 17 May 2024

scientific article
Language Label Description Also known as
English
The complexity of lifted inequalities for the knapsack problem
scientific article

    Statements

    The complexity of lifted inequalities for the knapsack problem (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    facets
    0 references
    valid inequalities
    0 references
    knapsack polytope
    0 references
    minimal covers
    0 references
    complexity of lifting
    0 references

    Identifiers