A branch-and-cut framework for the consistent traveling salesman problem
Year of publication: |
2016
|
---|---|
Authors: | Subramanyam, Anirudh ; Gounaris, Chrysanthos |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 248.2016, 2 (16.1.), p. 384-395
|
Subject: | Traveling salesman problem | Multi-period routing | Service consistency | Branch-and-cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Subramanyam, Anirudh, (2018)
-
Wu, Fuliang, (2023)
-
Gouveia, Luis, (2017)
- More ...
-
Convex relaxation for solving posynomial programs
Lu, Hao-Chun, (2010)
-
A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Subramanyam, Anirudh, (2018)
-
Robust multiperiod vehicle routing under customer order uncertainty
Subramanyam, Anirudh, (2021)
- More ...