A MIXED INTEGER PROGRAMMING APPROACH FOR THE MINIMUM MAXIMAL FLOW-Reference-Cited by-同舟云学术

A MIXED INTEGER PROGRAMMING APPROACH FOR THE MINIMUM MAXIMAL FLOW

Published:2018-10-25 Issue:4 Volume:61 Page:261-271
ISSN:0453-4514
Container-title:Journal of the Operations Research Society of Japan
language:en
Short-container-title:JORSJ

Author:

Lu Kuan¹,Mizuno Shinji¹,Shi Jianming²

Affiliation:

1. Tokyo Institute of Technology

2. Tokyo University of Science

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/61/4/61_261/_pdf

Reference12 articles.

1. [1] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: Network Flows: Theory, Algorithms, and Applications. (Prentice hall, 1993).

2. [2] L.T.H. An, P.D. Tao, and L.D. Muu: Numerical solution for optimization over the efficient set by dc optimization algorithms. Operations Research Letters, 19 (1996), 117–128.

3. [3] W. Chen, S. Masahiro, and J. Shi: The effective algorithm for minimum maximal network flow. IPSJ SIG Technical Reports, 2009 (2009), 1–6., in Japanese.

4. [4] R. Diestel: Graph Theory, 4th Edition. (Springer, 2012).

5. [5] J. Gotoh, N.V. Thoai, and Y. Yamamoto: Global optimization method for solving the minimum maximal flow problem. Optimization Methods and Software, 18 (2003), 395–415.

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

1. A New MIP Approach on the Least Distance Problem in DEA;Asia-Pacific Journal of Operational Research;2020-11-20

2. A Numerical Study on MIP Approaches over the Efficient Set;Advances in Intelligent Systems and Computing;2019-06-15