On affine reducibility of combinatorial polytopes (Q1761001): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The adjacency relation on the traveling salesman polytope is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacency on the constrained assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial study of partial order polytopes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:43, 5 July 2024

scientific article
Language Label Description Also known as
English
On affine reducibility of combinatorial polytopes
scientific article

    Statements

    On affine reducibility of combinatorial polytopes (English)
    0 references
    15 November 2012
    0 references
    nonadjacency
    0 references
    NP-complete
    0 references

    Identifiers