Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
Year of publication: |
2011
|
---|---|
Authors: | Bektas̜, Tolga ; Erdoğan, Günes̜ ; Røpke, Stefan |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 45.2011, 3, p. 299-316
|
Subject: | branch-and-cut | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
-
Online algorithms for the multi-vehicle inventory-routing problem with real-time demands
Bertazzi, Luca, (2023)
-
Schulz, Arne, (2024)
-
An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
Côté, Jean-François, (2014)
- More ...
-
An adaptive large neighbourhood search heuristic for the pollution-routing problem
Demir, Emrah, (2012)
-
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
Bektas, Tolga, (2011)
-
Routing strategy in a distribution network when the driver learning effect is considered
Battini, Daria, (2015)
- More ...