A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON
スポンサーリンク
概要
- 論文の詳細を見る
We present a new greedy algorithm for minimizing a separable convex function over an integral bisubmodular polyhedron. The algorithm starts with an arbitrary feasible solution and a current feasible solution increment,ally moves toward an optimal one in a greedy way. We also show that there exists at, least one optimal solution in the coordinate-wise steepest descent direction from a feasible solution if it is not an optimal one.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Ando Kazutoshi
Institute Of Policy And Planning Scicnces University Of Tsukuba
-
Ando Kazutoshi
University Of Tsukuba
-
Naitoh T
Shiga Univ.
-
Naitoh Takeshi
Faculty Of Economics Shiga University
-
Fujishige Satoru
Division of Systems Science Department of Systems and Human Science Graduate School of Enginecring S
-
Ando Kazutoshi
Insuitute of Socio-Economic Planning, University of Tsukuba
-
Fujishige Satoru
Insuitute of Socio-Economic Planning, University of Tsukuba
-
藤重 悟
Kyoto University
関連論文
- THE MINIMUM-WEIGHT IDEAL PROBLEM FOR SIGNED POSETS
- BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
- Optimal Sink Location Problem for Dynamic Flows in a Tree Network(Special Section on Discrete Mathematics and Its Applications)
- 劣モジュラ関数最小化のアルゴリズム:ブレイクスルーと周辺の話題 (特集 アルゴリズムの新展開--理論から工学へ)
- ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION
- STRUCTURES OF SUBLATTICES RELATED TO VEINOTT RELATION
- Algorithms for Submodular Flows(Special Issue on Algorithm Engineering : Surveys)
- Structures of Subpartitions Related to a Submodular Function Minimization