An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek best spanning arborescences of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Bottleneck Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Bounds for the Travelling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Bounding Procedure for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing rooted directed cuts in a weighted directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dual solutions of the linear assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank

Latest revision as of 15:04, 15 May 2024

scientific article
Language Label Description Also known as
English
An additive bounding procedure for the asymmetric travelling salesman problem
scientific article

    Statements

    An additive bounding procedure for the asymmetric travelling salesman problem (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    lower bounds
    0 references
    asymmetric travelling salesman
    0 references
    spanning arborescences
    0 references
    branch and bound
    0 references

    Identifiers