抄録
We present a polynomial time domain scaling algorithm for the minimization of an M-convex function. M-convex functions are nonlinear discrete functions with (poly)matroid structures, which are being recognized to play a fundamental role in tractable cases of discrete optimization. The novel idea of the algorithm is to use an individual scaling factor for each coordinate.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 21-35 |
| ページ数 | 15 |
| ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 巻 | 2337 LNCS |
| 出版ステータス | Published - 2002 12月 1 |
| 外部発表 | はい |
| イベント | 9th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2002 - Cambridge, MA, United States 継続期間: 2002 5月 27 → 2002 5月 29 |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- コンピュータ サイエンス（全般）