A specialized network simplex algorithm for the constrained maximum flow problem

作者：Caliskan Cenk^*

来源：European Journal of Operational Research, 2011, 210(2): 137-147.

DOI：10.1016/j.ejor.2010.10.018

• Network flows
• Maximum flow
• Linear programming
• Network simplex

The constrained maximum flow problem is to send the maximum flow from a source to a sink in a directed capacitated network where each arc has a cost and the total cost of the flow cannot exceed a budget. This problem is similar to some variants of classical problems such as the constrained shortest path problem, constrained transportation problem, or constrained assignment problem, all of which have important applications in practice. The constrained maximum flow problem itself has important applications, such as in logistics, telecommunications and computer networks. In this research, we present an efficient specialized network simplex algorithm that significantly outperforms the two widely used LP solvers: CPLEX and lp_solve. We report CPU times of an average of 27 times faster than CPLEX (with its dual simplex algorithm), the closest competitor of our algorithm.

• 出版日期2011-4-16