Comparing branch-and-price algorithms for the multi-commodity k-splittable maximum flow problem
Year of publication: |
2012
|
---|---|
Authors: | Gamst, M. ; Petersen, Bent |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 217.2012, 2 (1.3.), p. 278-286
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Gamst, M., (2012)
-
Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem
Gamst, M., (2012)
-
Case commentary: Global strategy gone astray: Maersk's big box boat and the world shipping industry
Petersen, Bent, (2019)
- More ...