Improving Linear Programming Approaches for the Steiner Tree Problem

Althaus, Ernst; Polzin, Tobias; Vahdati Daneshmand, Siavash; Jansen, Klaus; Margraf, Marian; Mastrolli, Monaldo; Rolim, José D. P.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Improving Linear Programming Approaches for the Steiner Tree Problem

MPS-Authors

/persons/resource/persons44003

Althaus, Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45206

Polzin, Tobias
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44695

Jansen, Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Althaus, E., Polzin, T., & Vahdati Daneshmand, S. (2003). Improving Linear Programming Approaches for the Steiner Tree Problem. In Experimental and efficient algorithms: Second International Workshop, WEA 2003 (pp. 1-14). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-2D3C-4

要旨

We present two theoretically interesting and empirically successful techniques for improving the linear programming approaches, namely graph transformation and local cuts, in the context of the Steiner problem. We show the impact of these techniques on the solution of the largest benchmark instances ever solved.