Network Optimization Problems : Algorithms, Applications and Complexity

by Du, Ding-Zhu; Pardalos, Panos M.

• ISBN13: 9789810212773
• ISBN10: 9810212771
• eBook ISBN(s): 9789812798190
• Format: Hardcover
• Copyright: 1993-08-01
• Publisher: World Scientific Pub Co Inc
• More Book Details
• Purchase Benefits

Table of Contents

Preface
Greedily Solvable Transportation Networks and Edge-Guided Vertex Elimination	p. 1
Networks Minimizing Length Plus the Number of Steiner Points	p. 23
Practical Experiences Using an Interactive Optimization Procedure for Vehicle Scheduling	p. 37
Subset Interconnection Designs: Generalizations of Spanning Trees and Steiner Trees	p. 53
Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization	p. 63
Hamiltonian Circuits for 2-Regular Interconnection Networks	p. 93
Equivalent Formulations for the Steiner Problem in Graphs	p. 111
Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost	p. 125
A Method for Solving Network Flow Problems with General Nonlinear Arc Costs	p. 147
Application of Global Line Search in Optimization of Networks	p. 169
Solving Nonlinear Programs with Embedded Network Structures	p. 177
On Algorithms for Nonlinear Dynamic Networks	p. 203
Strategic and Tactical Models and Algorithms for the Coal Industry Under the 1990 Clean Air Act	p. 233
Multi-Objective Routing in Stochastic Evacuation Networks	p. 263
A Simplex Method for Network Programs with Convex Separable Piecewise Linear Costs and Its Application to Stochastic Transshipment Problems	p. 283
A Bibliography on Network Flow Problems	p. 301
Tabu Search: Applications and Prospects	p. 333
The Shortest Path Network and Its Applications in Bicriteria Shortest Path Problems	p. 355
A Network Formalism for Pure Exchange Economic Equilibria	p. 363
Steiner Problem in Multistage Computer Networks	p. 387
Table of Contents provided by Blackwell. All Rights Reserved.