No label defined (Q3762096)

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 4012343
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4012343

      Statements

      0 references
      0 references
      1985
      0 references
      asymmetrical distance matrix
      0 references
      Travelling Salesman Problem
      0 references
      shortest Hamiltonian circuit
      0 references
      integer linear program
      0 references
      relaxation
      0 references
      network flow
      0 references
      branch and bound
      0 references
      [For the entire collection see Zbl 0619.00006.] This paper deals with a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian circuit through n clusters, in the case where the distance matrix is asymmetrical. The problem is formulated as an integer linear program. A relaxation of this program possessing a network structure is then considered. The relaxed problem is solved by embedding a network flow routine into a branch and bound algorithm. Some versions of the algorithm make use of Lagrangan relaxation. Computational results are reported.
      0 references

      Identifiers

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