An exact algorithm for the fixed charge transportation problem based on matching source and sink patterns
Year of publication: |
March-April 2018
|
---|---|
Authors: | Mingozzi, Aristide ; Roberti, Roberto |
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. 52.2018, 2, p. 229-238
|
Subject: | decomposition method | integer programming | column generation | branch and cut and price | fixed charge | transportation problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Transportproblem | Transportation problem | Ganzzahlige Optimierung | Integer programming | Innerbetrieblicher Transport | Internal transport | Dekompositionsverfahren | Decomposition method |
-
Roberti, Roberto, (2015)
-
Sun, Peter, (2014)
-
A greedy algorithm for solving ordinary transportation problem with capacity constraints
Liu, Fang, (2017)
- More ...
-
Baldacci, Roberto, (2012)
-
New route relaxation and pricing strategies for the vehicle routing problem
Baldacci, Roberto, (2011)
-
An exact algorithm for the multitrip vehicle routing problem
Mingozzi, Aristide, (2013)
- More ...