ダウンロード数: 206
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
jorsj.58.184.pdf | 201.53 kB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Fujishige, Satoru | en |
dc.contributor.author | Murota, Kazuo | en |
dc.contributor.author | Shioura, Akiyoshi | en |
dc.contributor.alternative | 藤重, 悟 | ja |
dc.date.accessioned | 2015-06-24T07:49:02Z | - |
dc.date.available | 2015-06-24T07:49:02Z | - |
dc.date.issued | 2015-06-23 | - |
dc.identifier.issn | 0453-4514 | - |
dc.identifier.uri | http://hdl.handle.net/2433/198549 | - |
dc.description.abstract | For the minimum cost flow problem, Hassin (1983) proposed a dual algorithm, which iteratively updates dual variables in a steepest ascent manner. This algorithm is generalized to the minimum cost submodular flow problem by Chung and Tcha (1991). In discrete convex analysis, the dual of the minimum cost flow problem is known to be formulated as maximization of a polyhedral L-concave function. It is recently pointed out by Murota and Shioura (2014) that Hassin's algorithm can be recognized as a steepest ascent algorithm for polyhedral L-concave functions. The objective of this paper is to show some monotonicity properties of the steepest ascent algorithm for polyhedral L-concave functions. We show that the algorithm shares a monotonicity property of Hassin's algorithm. Moreover, the algorithm finds the “nearest” optimal solution to a given initial solution, and the trajectory of the solutions generated by the algorithm is a "shortest" path from the initial solution to the "nearest" optimal solution. The algorithm and its properties can be extended for polyhedral \Lnat-concave functions. | en |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | - |
dc.publisher | Operations Research Society of Japan | en |
dc.rights | © The Operations Research Society of Japan | en |
dc.subject | Combinatorial optimization | en |
dc.subject | discrete concave function | en |
dc.subject | steepest ascent algorithm | en |
dc.subject | minimum cost flow | en |
dc.subject | discrete optimization | en |
dc.title | MONOTONICITY IN STEEPEST ASCENT ALGORITHMS FOR POLYHEDRAL L-CONCAVE FUNCTIONS | en |
dc.type | journal article | - |
dc.type.niitype | Journal Article | - |
dc.identifier.ncid | AA00703935 | - |
dc.identifier.jtitle | Journal of the Operations Research Society of Japan | en |
dc.identifier.volume | 58 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 184 | - |
dc.identifier.epage | 208 | - |
dc.relation.doi | 10.15807/jorsj.58.184 | - |
dc.textversion | publisher | - |
dc.relation.url | https://www.jstage.jst.go.jp/article/jorsj/58/2/58_184/_article | - |
dcterms.accessRights | open access | - |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。