Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Larissa Timajev"'
Autor:
Georg Kliewer, Larissa Timajev
Publikováno v:
Algorithms – ESA 2005 ISBN: 9783540291183
ESA
ESA
We present an evaluation of a Lagrangean-based branch-and-bound algorithm with additional valid inequalities for the capacitated network design problem. The focus is on two types of valid inequalities, the cover inequalities and local cuts. We show h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a99265037809bb2a776a74afa278fb54
https://doi.org/10.1007/11561071_7
https://doi.org/10.1007/11561071_7
Publikováno v:
Algorithms-ESA 2003 ISBN: 9783540200642
ESA
ESA
We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yields lower bounds of the graph bisection problem. We compare the approximation algorithm with Lagrangian relaxation based cost-decomposition approaches a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::918a9f18c4ea122818f122e9a919b54f
https://doi.org/10.1007/978-3-540-39658-1_67
https://doi.org/10.1007/978-3-540-39658-1_67