Interior point algorithms for network flow problems

Mauricio G.C. Resende and Panos M. Pardalos

In Advances in linear and integer programming, J. E. Beasley, ed., Oxford University Press, pp. 147-187, 1996


Computational algorithms for the solution of network flow problems are of great practical significance.  In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve large scale network flow problems.  In this chapter, we review interior point approaches for network flows, with emphasis on computational issues.

PDF file of full paper

DjVu file of full paper
Go back
Mauricio G.C. Resende's Home Page
Last modified: 06 March 2003

Copyright Notice