A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM

Published:2004 Issue:1 Volume:47 Page:1-17
ISSN:0453-4514
Container-title:Journal of the Operations Research Society of Japan
language:en
Short-container-title:JORSJ

Author:

Eguchi Akinobu¹,Fujishige Satoru²,Takabatake Takashi³

Affiliation:

1. Panasonic Mobile Communications Co., Ltd.

2. Kyoto University

3. Kochi Gakuen College

Publisher

The Operations Research Society of Japan

Subject

Management Science and Operations Research,General Decision Sciences

Link

https://www.jstage.jst.go.jp/article/jorsj/47/1/47_KJ00000757438/_pdf

Reference12 articles.

1. 1) EDMONDS J. A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics. (1977) vol.1, p.185-204.

2. 2) FUJISHIGE S. Submodular functions and optimization. North-Holland. (1991)

3. 3) GONDRAN M. Graphs and Algorithms. Wiley. (1984)

4. 4) MCCORMICK S. T. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. Operations Research Letters. (2000) vol.27, p.199-207.

5. 5) COHEN E. Improved algorithms for linear inequalities with two variables per inequality. SIAM Journal on Computing. (1994) vol.23, p.1313-1347.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Method for Finding the Maximum Dynamic Flow in Periodic Fuzzy Graphs;2024 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM);2024-05-20

2. Incremental Digital Content Object Delivering in Distributed Systems;IEICE Transactions on Information and Systems;2010

3. Maximum network flows with concave gains;Mathematical Programming;2005-12-02

4. A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS(Network Design, Control and Optimization);Journal of the Operations Research Society of Japan;2004

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3