繁野 麻衣子(シゲノ マイコ)
- 論文
- 最大密度部分集合問題と近似2分探索による解法
張 明超; 高橋 里司; 繁野 麻衣子
日本オペレーションズ・リサーチ学会和文論文誌/53(0)/pp.1-13, 2010-12 - 顧客志向ビジネス・イノベーションのためのサービス科学に基づく高度専門職業人育成プログラムの開発(<レクチャーシリーズ>サービスイノベーションとAIと教育〔第3回〕)
高木 英明; 岡田 幸彦; 吉瀬 章子; 繁野 麻衣子
人工知能学会誌/25(5)/pp.726-734, 2010-09 - A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Ichimura Akira; Shigeno Maiko
INFORMATION PROCESSING LETTERS/110(12-13)/pp.514-517, 2010-06 - Community Extraction in Hypergraphs Based on Adjacent Numbers
Hiroyuki Miyagawa; Maiko Shigeno; Satoshi Takahashi; and ...
Lecture Notes in Operations Research/12/p.309–316, 2010-01 - New Bounds on the Minimum Number of Calls in Failure-Tolerant Gossiping
Hou Zhe; Shigeno Maiko
NETWORKS/53(1)/pp.35-38, 2009-01 - An adjustable robust approach for a 1-median location problem on a tree
Shigeno Maiko
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN/51(2)/pp.127-135, 2008-06 - ネットワーク流と時の流れ(<特集>21世紀を最適化する女性たち)
繁野 麻衣子
オペレーションズ・リサーチ : 経営の科学/51(7)/pp.416-419, 2006-07 - Maximum network flows with concave gains
Shigeno M
MATHEMATICAL PROGRAMMING/107(3)/pp.439-459, 2006-07 - A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
Satoru Iwata; S. Thomas McCormick; Maiko Shigeno
SIAM Journal on Discrete Mathematics/19/p.304-320, 2005-01 - A strongly polynomial cut canceling algorithm for minimum cost submodular flow
Iwata S; McCormick ST; Shigeno M
SIAM JOURNAL ON DISCRETE MATHEMATICS/19(2)/pp.304-320, 2005-01 - A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(Network Design, Control and Optimization)
Shigeno Maiko
Journal of the Operations Research Society of Japan/47(4)/pp.244-264, 2004-12 - 実市街地データへの難燃化整備計画問題の適用可能性
阿部 英樹; 糸井川 栄一; 繁野 麻衣子
地域安全学会論文集/0(6)/pp.149-154, 2004-11 - A Survey of Combinatorial Maximum Flow Algorithms on a Network with Gains
Maiko SHIGENO
Journal of the Operations Research Society of Japan/47/p.244-264, 2004-01 - Minimum maximal flow problem - An optimization over the efficient set-(共著)
Maiko SHIGENO; Ichiro TAKAHASHI; Yoshitsugu YAMAMOTO
Journal of Global Optimization/25/p.425-443, 2003-01 - Fast Cycle Calnceling Algorithm for Minimum Cost Submodular Flow (共著)
Satoru IWATA; S. Thomas McCORMICK; Maiko SHIGENO
Combinatorica/23/p.503-525, 2003-01 - Fast cycle canceling algorithms for minimum cost submodular flow
Iwata S; McCormick ST; Shigeno M
COMBINATORICA/23(3)/pp.503-525, 2003-01 - Progress in the Healthcare Service Innovation Project at the Tsukuba University Hospital
Takagi Hideaki; Kurata Hisashi; Okada Yukihiko; Shigeno ...
SRII '12 Proceedings of the 2012 Annual SRII Global Conference/pp.667-671, 2012-07 - Minimax Inverse Problems of Minimum Cuts
Maiko SHIGENO
Networks/39/p.7-14, 2002-01 - Conjugate scaling technique for Fenchel-type duality in discrete convex opttimization（共著）
Satoru IWATA; Maiko SHIGENO
SIAM Journal on Optimization/13/p.204-211, 2002-01 - Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow (共著)
Maiko SHIGENO; Satoru IWATA; S. Thomas McCORMICK
Mathematics of Operations Research/25(1)/p.76-104, 2000-01 - A Fast Cost Scaling algorithm for Submodular flow (共著)
Satoru IWATA; S.Thomas McCORMICK; Maiko SHIGENO
Information Processing Letters/74/p.123-128, 2000-01 - A strongly polynomial cut canceling algorithm for the submodular flow problem(共著)
Satoru IWATA; S. Thomas McCORMICK; Maiko SHIGENO
Proceedings of the 7th International Integer Programming and Combinatorial Optimization/p.259-272, 1999-01 - A faster algorithm for minimum cost submodular flows
Satoru IWATA; S. Thomas McCORMICK; Maiko SHIGENO
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms/p.167-174, 1998-01 - A cost-scaling algorithm for 0-1 submodular flows(共著)
Maiko SHIGENO; Satoru IWATA
Discrete Applied Mathematics/73/p.261-273, 1997-01 - The tree center problems and the relationship with the bottleneck knapsack problems(共著)
Akiyoshi SHIOURA; Maiko SHIGENO
Networks/29/p.107-110, 1997-01 - さらに表示...
- 最大密度部分集合問題と近似2分探索による解法