A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning 
Tree Problem

Behle, Markus; Jünger, Michael; Liers, Frauke

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

MPS-Authors

/persons/resource/persons44107

Behle, Markus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;
International Max Planck Research School, 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

引用

Behle, M., Jünger, M., & Liers, F. (2007). A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. In C., Demetrescu (Ed.), 6th Workshop on Experimental Algorithms (WEA'07) (pp. 379-392). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-216A-9

要旨

要旨はありません