Sometimes travelling is easy: The master tour problem (Q6102296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edgeconvex Circuits and the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank

Latest revision as of 02:01, 1 August 2024

scientific article; zbMATH DE number 7683191
Language Label Description Also known as
English
Sometimes travelling is easy: The master tour problem
scientific article; zbMATH DE number 7683191

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references