A branch and bound algorithm for the symmetric traveling salesman problem based on the l-tree relaxation
Year of publication: |
1982
|
---|---|
Authors: | Volgenant, Ton ; Jonker, Roy |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 9.1982, 1, p. 83-89
|
Subject: | Unternehmensforschung | Reihenfolgeproblem |
-
Gschrei, Ulrich, (1983)
-
Schnittebenenverfahren für Travelling-Salesman- und verwandte Probleme
Holland, Olaf A., (1987)
-
Logistische Routenplanung unter Zeitrestriktionen : eine Simulationsstudie
Grupp, Bernhard, (1987)
- More ...
-
Nonoptimal edges for the symmetric traveling salesman problem
Jonker, Roy, (1984)
-
The symmetric traveling salesman problem and edge exchanges in minimal l-tress
Volgenant, Ton, (1983)
-
The symmetric traveling salesman problem and edge exchanges in minimal 1-trees
Volgenant, Ton, (1983)
- More ...