Network Optimization Problems: Algorithms, Applications And Complexity

Ding-zhu Du, Panos M Pardalos

• Publisher: World Scientific
• Year: 1993
• Print ISBN: 9789810212773, 9789810212773
• eBook ISBN: 9789812798190
• Topic: Biological Sciences
• Subtopic: Science General
• Index: Biological Sciences

In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems.

Table of contents

• Contents
• Preface
• Greedily Solvable Transportation Networks and Edge-Guided Vertex Elimination
• Networks Minimizing Length Plus the Number of Steiner Points
• Practical Experiences Using an Interactive Optimization Procedure for Vehicle Scheduling
• Subset Interconnection Designs: Generalizations of Spanning Trees and Steiner Trees
• Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization
• Hamiltonian Circuits for 2-Regular Interconnection Networks
• Equivalent Formulations for the Steiner Problem in Graphs
• Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost
• A Method for Solving Network Flow Problems with General Nonlinear Arc Costs
• Application of Global Line Search in Optimization of Networks
• Solving Nonlinear Programs with Embedded Network Structures
• On Algorithms for Nonlinear Dynamic Networks
• Strategic and Tactical Models and Algorithms for the Coal Industry Under the 1990 Clean Air Act
• Multi-Objective Routing in Stochastic Evacuation Networks
• A Simplex Method for Network Programs with Convex Separable Piecewise Linear Costs and Its Application to Stochastic Transshipment Problems
• A Bibliography on Network Flow Problems
• Tabu Search: Applications and Prospects
• The Shortest Path Network and Its Applications in Bicriteria Shortest Path Problems
• A Network Formalism for Pure Exchange Economic Equilibria
• Steiner Problem in Multistage Computer Networks