A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows
Year of publication: |
2020
|
---|---|
Authors: | Yuan, Yuan ; Cattaruzza, Diego ; Ogier, Maxime ; Semet, Frédéric |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 2, p. 167-169
|
Subject: | Miller-Tucker-Zemlin | Routing problems | Subtour elimination constraints | Time windows | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
Bektaş, Tolga, (2014)
-
New strategy for anti-loop formulations
García Sánchez, José Manuel, (2024)
-
Dial-A-Ride Problems in Transportation Service
Grimm, Jonathan, (2024)
- More ...
-
A column generation based heuristic for the generalized vehicle routing problem with time windows
Yuan, Yuan, (2021)
-
Yuan, Yuan, (2021)
-
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Yuan, Yuan, (2020)
- More ...