A time bucket formulation for the traveling salesman problem with time windows
| Year of publication: |
2012
|
|---|---|
| Authors: | Dash, Sanjeeb ; Günlük, Oktay ; Lodi, Andrea ; Tramontani, Andrea |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 1, p. 132-147
|
| Subject: | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Self-organisation migration technique for enhancing the permutation coded genetic algorithm
Dinesh, Kamala Kannan, (2021)
-
Gołąbek, Łukasz, (2021)
- More ...
-
Recovering Dantzig-Wolfe bounds by cutting planes
Chen, Rui, (2025)
-
Two-step MIR inequalities for mixed integer programs
Dash, Sanjeeb, (2010)
-
Strengthened benders cuts for stochastic integer programs with continuous recourse
Bodur, Merve, (2017)
- More ...