Some further results on minimum distribution cost flow problems-Reference-Cited by-同舟云学术

Some further results on minimum distribution cost flow problems

Published:2006-05-17 Issue: Volume: Page:
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Lu Haiyan,Yao Enyu,Qi Liqun

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-006-8211-9.pdf

Reference15 articles.

1. Ahuja RK, Magnanti TL, Orlin JR (1993) Network flows: Theory, Algorithms, and applications. Prentice Hall, New Jersey

2. Ahuja RK, Orlin JB, Sechi GM, Zuddas P (1999) Algorithms for the simple equal flow problem. Management Scinece 45:1440–1455

3. Askin RG, Standridge CR (1993) Modeling and Analysis of Manufacturing System. John Wiley and Sons, New York

4. Bazaraa MS, Jarvis JJ, Sherali HD (1990) Linear Programming and Network Flows. John Wiley and Sons, New York

5. Brauldi RA (2002) Introductory combinatorics. Prentice Hall and China Machine Press, Beijing

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

1. A novel approach to subgraph selection with multiple weights on arcs;Journal of Combinatorial Optimization;2021-11-13

2. Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode;Journal of Combinatorial Optimization;2019-12-19

3. Maximum flows in generalized processing networks;Journal of Combinatorial Optimization;2016-05-21

4. A compaction scheme and generator for distribution networks;Journal of Industrial and Management Optimization;2015-04

5. A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks;Optimization Letters;2011-06-17