Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cornuéjols, Gérard / rank
Normal rank
 
Property / author
 
Property / author: William R. Pulleyblank / rank
Normal rank
 
Property / author
 
Property / author: Cornuéjols, Gérard / rank
 
Normal rank
Property / author
 
Property / author: William R. Pulleyblank / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29302516 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matching problem with side conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: Q4405192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4080661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum node covers and 2-bicritical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:15, 14 June 2024

scientific article
Language Label Description Also known as
English
Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
scientific article

    Statements

    Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (English)
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    perfect matching
    0 references
    2-matching
    0 references
    Hamiltonian cycle
    0 references
    hypomatchable
    0 references
    0 references