Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
Year of publication: |
2005
|
---|---|
Authors: | Duchenne, Eric ; Laporte, Gilbert ; Semet, Frederic |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 162.2005, 3, p. 700-712
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An optimality cut for mixed integer linear programs
Laporte, Gilbert, (1999)
-
A tabu search heuristic for the undirected selective travelling salesman problem
Gendreau, Michel, (1998)
-
Ambulance location and relocation models
Brotcorne, Luce, (2003)
- More ...