Tight lower bounds for the Traveling Salesman Problem with draft limits
Year of publication: |
2023
|
---|---|
Authors: | Balma, Ali ; Mrad, Mehdi ; Ladhari, Talel |
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. 154.2023, p. 1-21
|
Subject: | Traveling Salesman | Time-dependent model | Multi-commodity flow | Reformulation-Linearization Technique | Draft limits | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
Balma, Ali, (2018)
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
The traveling salesman problem with pickups, deliveries, and draft limits
Malaguti, Enrico, (2018)
- More ...
-
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
Balma, Ali, (2018)
-
Allocating nodes to hubs for minimizing the hubs processing resources : a case study
Balma, Ali, (2019)
-
Balma, Ali, (2011)
- More ...