Scaling algorithms for network problems
Journal of Computer and System Sciences
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A heuristic solution procedure for multicommodity integer flows
Computers and Operations Research
A dynamic programming based algorithm for the crew scheduling problem
Computers and Operations Research
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Algorithms for Network Programming
Algorithms for Network Programming
An efficient network flow code for finding all minimum cost s-t cutsets
Computers and Operations Research
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
Hi-index | 0.01 |
This paper presents a method of modeling and solving a very complicated real logistic problem in the management of transportation and sales. The problem to be addressed is a large-scale multicommodity, multi-source and multi-sink network flow optimization, of 12 types of coal from 29 mines, through over 200 railway stations along 5 railroad arteries, in Chongqing Coal Industry Company of China. A minimum-cost flow model is established for the network system, and several maximal-flow algorithms are implemented to produce an optimal scheme.