Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1168891
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Frank Koerner / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(89)90470-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047927433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling Salesman and Assignment Problems: A Survey / 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: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the refinement of bounds of heuristic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Data-Dependent Bounds for Heuristics to Find a Minimum Weight Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of non-optimal arcs for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming asymmetric into symmetric traveling salesman problems / 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: Q3778565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative Algorithms for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein beitrag zur klassifizierung von rundreiseproblemen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Christofides' lower bound for the traveling salesman problem / rank
 
Normal rank

Latest revision as of 15:12, 19 June 2024

scientific article
Language Label Description Also known as
English
Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
scientific article

    Statements

    Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The authors discuss the transformation of the distance matrix in the traveling salesman problem in order to use a given heuristic algorithm. Some performance bounds are derived.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    triangle inequality
    0 references
    transformation of the distance matrix
    0 references
    traveling salesman
    0 references
    heuristic algorithm
    0 references
    performance bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references