Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4099068
Language Label Description Also known as
default for all languages
No label defined
    English
    Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem
    scientific article; zbMATH DE number 4099068

      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
      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

      Identifiers

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