A branch-and-bound algorithm for the time-dependent rural postman problem
| Year of publication: |
February 2019
|
|---|---|
| Authors: | Calogiuri, Tobia ; Ghiani, Gianpaolo ; Guerriero, Emanuela ; Mansini, Renata |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 102.2019, p. 150-157
|
| Subject: | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Jin, Bo, (2023)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Groiez, Mounira, (2013)
- More ...
-
The multi-period p-center problem with time-dependent travel times
Calogiuri, Tobia, (2021)
-
Scenario-based planning for lot-sizing and scheduling with uncertain processing times
Beraldi, Patrizia, (2006)
-
Scenario-based planning for lot-sizing and scheduling with uncertain processing times
Beraldi, Patrizia, (2006)
- More ...