Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
Year of publication: |
2011
|
---|---|
Authors: | Subramanian, Anand ; Uchoa, Eduardo ; Pessoa, Artur ; Ochi, Luiz Satoru |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 39.2011, 5, p. 338-341
|
Subject: | Heuristik | Heuristics | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
The timetable constrained distance minimization problem
Rasmussen, Rasmus V., (2009)
-
The open capacitated arc routing problem
Usberti, Fábio Luiz, (2011)
-
An approach to the asymmetric multi-depot capacitated arc routing problem
Krushnisky, Dmitry, (2015)
- More ...
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
New benchmark instances for the capacitated vehicle routing problem
Uchoa, Eduardo, (2017)
-
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Subramanian, Anand, (2012)
- More ...