Name
Abstract | ||
|---|---|---|
•A branch-and-bound algorithm for solving the time-dependent rural postman problem.•A procedure to compute lower and upper bounds on the optimal solution value.•Computational experiments show that the algorithm can successfully solve some instances with up to 60 required arcs. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2018.07.016 | Computers & Operations Research |
Field | DocType | Volume |
Mathematical optimization,Branch and bound,Arc (geometry),Tree traversal,Time horizon,Mathematics | Journal | 102 |
ISSN | Citations | PageRank |
0305-0548 | 1 | 0.35 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tobia Calogiuri | 1 | 6 | 2.17 |
| Gianpaolo Ghiani | 2 | 548 | 40.62 |
| E. Guerriero | 3 | 104 | 11.21 |
| Renata Mansini | 4 | 574 | 43.10 |