The traveling salesman problem on a graph and some related integer polyhedra (Q3675933): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1184342
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jean Fonlupt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q96162135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of cutting planes for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between the biconnectivity augmentation and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4080661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083210138 / rank
 
Normal rank

Latest revision as of 09:33, 30 July 2024

scientific article
Language Label Description Also known as
English
The traveling salesman problem on a graph and some related integer polyhedra
scientific article

    Statements

    The traveling salesman problem on a graph and some related integer polyhedra (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graphical traveling Salesman
    0 references
    minimum length cycle
    0 references
    facet
    0 references
    comb inequalities
    0 references
    integer polyhedra
    0 references
    efficient algorithm
    0 references
    Steiner tree
    0 references
    polynomial algorithm
    0 references
    series-parallel graph
    0 references
    0 references
    0 references