An analog of the Cook theorem for polytopes (Q1759309): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All 0-1 polytopes are traveling salesman polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 22:23, 5 July 2024

scientific article
Language Label Description Also known as
English
An analog of the Cook theorem for polytopes
scientific article

    Statements

    An analog of the Cook theorem for polytopes (English)
    0 references
    20 November 2012
    0 references
    cut polytope
    0 references
    polytope of the knapsack problem
    0 references
    facets
    0 references
    polynomial reducibility of problems
    0 references

    Identifiers