Two heuristics for the capacitated minimum spanning tree problem with time windows
Year of publication: |
2019
|
---|---|
Authors: | Kritikos, Manolis N. ; Ioannou, George |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 70.2019, 4, p. 555-567
|
Subject: | Spanning tree | heuristics | time windows | Heuristik | Heuristics | Graphentheorie | Graph theory | Scheduling-Verfahren | Scheduling problem | Tourenplanung | Vehicle routing problem |
-
Jozefowiez, Nicolas, (2013)
-
A learning tabu search and graph models for a location-distribution problem in a railway network
Schindl, David, (2013)
-
Kulich, Miroslav, (2022)
- More ...
-
An assignment-based heuristic for vehicle routing with time windows
Ioannou, George, (2008)
-
The balanced cargo vehicle routing problem with time windows
Kritikos, Manolis N., (2010)
-
The heterogeneous fleet vehicle routing problem with overloads and time windows
Kritikos, Manolis N., (2013)
- More ...