The fixed-charge shortest-path problem
Year of publication: |
2012
|
---|---|
Authors: | Engineer, Faramroze G. ; Nemhauser, George L. ; Savelsbergh, Martin W. P. ; Song, Jin-hwa |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 24.2012, 4, p. 578-596
|
Subject: | Spieltheorie | Game theory | Operations Research | Operations research | Heuristik | Heuristics | Transportproblem | Transportation problem | USA | United States |
-
Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
Gendron, Bernard, (2014)
-
Modeling fixed-charge problems with polynomials
Lev, Benjamin, (2011)
-
The freight allocation problem with all-units quantity-based discount : a heuristic algorithm
Qin, Hu, (2012)
- More ...
-
A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing
Engineer, Faramroze G., (2012)
-
The Fixed-Charge Shortest-Path Problem
Engineer, Faramroze G., (2012)
-
A branch-price-and-cut algorithm for single-product maritime inventory routing
Engineer, Faramroze G., (2012)
- More ...