Solving the single-sink, fixed-charge, multiple-choice transportation problem by dynamic programming
Year of publication: |
2013
|
---|---|
Authors: | Christensen, Tue R. L. ; Andersen, Kim Allan ; Klose, Andreas |
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, 3, p. 428-438
|
Subject: | supplier selection | network flow | piecewise linear cost | dynamic programming | mixed-integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Lieferkette | Supply chain | Lieferantenbewertung | Supplier evaluation |
-
Li, Xin, (2018)
-
Hu, Xiangling, (2012)
-
Incentivizing suppliers using scorecard : a behavioral study
Shokoohyar, Sina, (2022)
- More ...
-
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
Christensen, Tue R. L., (2013)
-
A branch-cut-and-price algorithm for the piecewise linear transportation problem
Christensen, Tue R. L., (2015)
-
The bicriterion multimodal assignment problem : introduction, analysis, and experimental results
Pedersen, Christian Roed, (2008)
- More ...