An algorithm for the bottleneck traveling salesman problem
Year of publication: |
1984
|
---|---|
Authors: | Carpaneto, Giorgio ; Martello, Silvano ; Toth, Paolo |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 32.1984, 2, p. 380-389
|
Subject: | Mathematik | Graphentheorie | Unternehmensforschung |
-
Sum-of-squares representations for copositive matrices and independent sets in graphs
Vargas, Luis, (2023)
-
Heuristics with constant error guarantees for the design of tree networks
Altinkemer, Kemal, (1988)
-
Facilities layout generalized model solved by n-boundary shortest path heuristics
Giffin, J. W., (1987)
- More ...
-
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Carpaneto, Giorgio, (1980)
-
Erratum to "Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem"
Carpaneto, Giorgio, (1981)
-
A new algorithm for the travelling salesman problem with duedates
Carpaneto, Giorgio, (1977)
- More ...