Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Spenke, Ines"'
Autor:
Koch, Ronald, Spenke, Ines
Publikováno v:
In Theoretical Computer Science 2006 369(1):338-347
We investigate a complex stacking problem that stems from storage planning of steel slabs in integrated steel production. Besides the practical importance of such stacking tasks, they are appealing from a theoretical point of view. We show that alrea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::63a744b7a13a130c47ab49b0b7e35bff
https://depositonce.tu-berlin.de/handle/11303/15624
https://depositonce.tu-berlin.de/handle/11303/15624
Autor:
Koch, Ronald, Spenke, Ines
Let G=(V,E) be a graph with a source node s and a sink node t, |V| = n, |E|= m. For a given number k, the Maximum k-Splittable Flow Problem (MkSF) is to find an s,t-flow of maximum value with a flow decomposition using at most k paths. In the multico
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::7f1687700a6570abc4b4594519d185f4
https://depositonce.tu-berlin.de/handle/11303/15553
https://depositonce.tu-berlin.de/handle/11303/15553
Given a graph with a source and a sink node, the NP-hard maximum k-splittable s,t-flow (MkSF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths. The multicommodity variant of this problem is a natu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::d4283b67e39f49a1e1ba2adb4224eead
https://depositonce.tu-berlin.de/handle/11303/15552
https://depositonce.tu-berlin.de/handle/11303/15552
Given a graph with a source and a sink node, the maximum k-splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths. In the more general context of multicommodity flows, this NP-hard problem ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______793::4f1cb7007aa81785cebf07b53d0fd359
https://depositonce.tu-berlin.de/handle/11303/15535
https://depositonce.tu-berlin.de/handle/11303/15535
Publikováno v:
Approximation & Online Algorithms (9783540322078); 2006, p244-257, 14p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theory of Computing Systems; Jul2008, Vol. 43 Issue 1, p56-66, 11p