Canceling most helpful total cuts for minimum cost network flow-Reference-Cited by-同舟云学术

Canceling most helpful total cuts for minimum cost network flow

Published:1993-01 Issue:1 Volume:23 Page:41-52
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Ervolina Thomas R.,McCormick S. Thomas

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference24 articles.

1. , and , Network flows. Handbooks in Operations Research and Management Science, Volume 1: Optimization, (, and , Eds.) North-Holland, Amsterdam (1988) pp. 211–369.

2. Improved Time Bounds for the Maximum Flow Problem

3. Note on Weintraub’s Minimum-Cost Circulation Algorithm

4. Linear Programming. W. H. Freeman, New York (1983).

5. Dual cancelling algorithms and integrality results for network flow problems. PhD Thesis, Columbia University IE/OR Department, New York, NY (1989).

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

1. A new approach for computing a most positive cut using the minimum flow algorithms;Applied Mathematics and Computation;2006-05

2. A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow;SIAM Journal on Discrete Mathematics;2005-01

3. Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks;Operations Research Letters;2000-12

4. Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow;Mathematics of Operations Research;2000-02

5. How to compute least infeasible flows;Mathematical Programming;1997-08