A polynomial time approximation algorithm for the two-commodity splittable flow problem
Year of publication: |
2013
|
---|---|
Authors: | Eisenschmidt, Elke ; Haus, Utz-Uwe |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 77.2013, 3, p. 381-391
|
Subject: | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
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 ...
-
A polynomial time approximation algorithm for the two-commodity splittable flow problem
Eisenschmidt, Elke, (2013)
-
A polynomial time approximation algorithm for the two-commodity splittable flow problem
Eisenschmidt, Elke, (2013)
-
A polynomial time approximation algorithm for the two-commodity splittable flow problem
Eisenschmidt, Elke, (2013)
- More ...