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 …
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 …
Linear network optimization problems such as shortest path, assignment, max-flow, transportation, and transhipment, are undoubtedly the most common optimization problems …
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 …
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 …
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 …
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 …
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 …