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 : the publication of the Transportation Science Section, Operation Research Society of America. - Hanover, Md : INFORMS, ISSN 0041-1655, ZDB-ID 1609580. - Vol. 47.2013, 3, p. 428-438
|
Saved in:
Saved in favorites
Similar items by person
-
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)
-
Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs
Andersen, Kim Allan, (1999)
- More ...