Approximation algorithms for capacitated location routing
Year of publication: |
2013
|
---|---|
Authors: | Harks, Tobias ; König, Felix G. ; Matuschke, Jannik |
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. 3-22
|
Subject: | Tourenplanung | Vehicle routing problem | Iteratives Verfahren | Approximation method | Algorithmus | Algorithm | Standortfaktor | Location factor | Transportproblem | Transportation problem | Mathematische Optimierung | Mathematical programming |
-
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Brenner, Ulrich, (2008)
-
A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
Karaoglan, Ismail, (2011)
-
Vehicle dispatching algorithms for container transshipment hubs
Lee, Loo Hay, (2010)
- More ...
-
An integrated approach to tactical transportation planning in logistics networks
Harks, Tobias, (2016)
-
Fare evasion in transit networks
Correa, José, (2017)
-
Approximation Algorithms for Capacitated Location Routing
Harks, Tobias, (2013)
- More ...