CNOP - A Package for Constrained Network Optimization

Mehlhorn, Kurt; Ziegelmann, Mark; Buchsbaum, Adam L.; Snoeyink, Jack

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

CNOP - A Package for Constrained Network Optimization

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45802

Ziegelmann, Mark
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44198

Buchsbaum, Adam L.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Snoeyink, Jack
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

引用

Mehlhorn, K., & Ziegelmann, M. (2001). CNOP - A Package for Constrained Network Optimization. In Algorithm engineering and experimentation (ALENEX-01):Third International Workshop ALENEX 2001; revised papers (pp. 17-31). Berlin, Germany: Springer.

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

要旨

We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications: route planning, curve approximation, minimum cost reliability constrained spanning trees and the table layout problem.