A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
Year of publication: |
2013
|
---|---|
Authors: | Jepsen, Mads ; Spoorendonk, Simon ; Ropke, 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. 47.2013, 1, p. 23-37
|
Subject: | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Transportproblem | Transportation problem | Kapazitätsplanung | Capacity planning | Branch-and-Bound | Branch and Bound |
-
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Karaoglan, Ismail, (2011)
-
Practical solutions for a dock assignment problem with trailer transportation
Berghman, Lotte, (2015)
-
A branching method for the fixed charge transportation problem
Adlakha, Veena G., (2010)
- More ...
-
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Jepsen, Mads, (2013)
-
Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
Jepsen, Mads, (2008)
-
Simultaneously exploiting two formulations : an exact benders decomposition approach
Lusby, Richard Martin, (2020)
- More ...