[PDF][PDF] Network flows

RK Ahuja, TL Magnanti, JB Orlin - 1988 - dspace.mit.edu
Network flows Page 1 Page 2 ^"V. ^^ Page 3 Page 4 Page 5 Dewey WORKING PAPER ALFRED
P. SLOAN SCHOOL OF MANAGEMENT NETWORK FLOWS Ravindra K. Ahuja Thomas L …

A survey of linear cost multicommodity network flows

JL Kennington - Operations Research, 1978 - pubsonline.informs.org
Network Flows Page 1 OPERATIONS RESEARCH ()030-364X/ 78/ 2602-(_)000 $01._25 Vol.
26, N0. 2, March—April 1978 © 1978 Operations Research Society 0fAII18rllI8 A Survey of …

Relaxation methods for minimum cost ordinary and generalized network flow problems

DP Bertsekas, P Tseng - Operations research, 1988 - pubsonline.informs.org
We propose a new class of algorithms for linear cost network flow problems with and without
gains. These algorithms are based on iterative improvement of a dual cost and operate in a …

A problem in network interdiction

B Golden - Naval Research Logistics Quarterly, 1978 - Wiley Online Library
Suppose we are given a network G=(V, E) with arc distances and a linear cost function for
lengthening arcs. In this note, we consider a network‐interdiction problem in which the …

[PDF][PDF] Linear network optimization

DP Bertsekas - 1991 - mit.edu
Linear network optimization problems such as shortest path, assignment, max-flow,
transportation, and transhipment, are undoubtedly the most common optimization problems …

An efficient implementation of the network simplex method

MD Grigoriadis - Netflow at Pisa, 1986 - Springer
This paper describes an efficient implementation of the network simplex method for solving
large sparse minimum-cost network flow problems. This is a single-phase implementation …

The relax codes for linear minimum cost network flow problems

DP Bertsekas, P Tseng - Annals of Operations Research, 1988 - Springer
We describe a relaxation algorithm [1, 2] for solving the classical minimum cost network flow
problem. Our implementation is compared with mature state-of-the-art primal simplex and …

Current and future research directions in network optimization

B Golden, M Ball, L Bodin - Computers & Operations Research, 1981 - Elsevier
In this paper, we discuss a number of current and future research directions in network
optimization. First, we categorize current research efforts as primarily methodological or …

Generalized networks: A fundamental computer-based planning tool

F Glover, J Hultz, D Klingman… - Management Science, 1978 - pubsonline.informs.org
This paper documents the recent emergence of generalized networks as a fundamental
computer-based planning tool and demonstrates the power of the associated modeling and …

Chapter iv network flows

RK Ahuja, TL Magnanti, JB Orlin - Handbooks in operations research and …, 1989 - Elsevier
Publisher Summary This chapter discusses the fundamental ideas of network optimization.
Networks provide a concrete setting for testing and devising new theories and serves as the …