Network optimization is important in the modeling of problems and processes from such fields as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Recent advances in data structures, computer technology, and algorithm development have made it possible to solve classes of network optimization problems that until recently were intractable. The refereed papers in this volume reflect the interdisciplinary efforts of a large group of scientists from academia and industry to model and solve complicated large-scale network optimization problems.

## Network Optimization and Control

## Lineare und Netzwerk-Optimierung / Linear and Network-Optimization

*Ein bilinguales Lehrbuch. A bilingual textbook*

## Network Optimization Problems: Algorithms, Applications and Complexity

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. Contents:Greedily Solvable Transportation Networks and Edge-Guided Vertex Elimination (I Adler & R Shamir)Networks Minimizing Length Plus the Number of Steiner Points (T Colthurst et al.)Practical Experiences Using an Interactive Optimization Procedure for Vehicle Scheduling (J R Daduna et al.)Subset Interconnection Designs: Generalizations of Spanning Trees and Steiner Trees (D-Z Du & P M Pardalos)Polynomial and Strongly Polynomial Algorithms for Convex Network Optimization (D S Hochbaum)Hamiltonian Circuits for 2-Regular Interconnection Networks (F K Hwang & W-C W Li)Equivalent Formulations for the Steiner Problem in Graphs (B N Khoury et al.)Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost (B Klinz & H Tuy)A Method for Solving Network Flow Problems with General Nonlinear Arc Costs (B W Lamar)Application of Global Line Search in Optimization of Networks (J Mockus)Solving Nonlinear Programs with Embedded Network Structures (M Ç Pinar & S A Zenios)On Algorithms for Nonlinear Dynamic Networks (W B Powell et al.)Strategic and Tactical Models and Algorithms for the Coal Industry Under the 1990 Clean Air Act (H D Sherali & Q J Saifee)Multi-Objective Routing in Stochastic Evacuation Networks (J M Smith)A Simplex Method for Network Programs with Convex Separable Piecewise Linear Costs and Its Application to Stochastic Transshipment Problems (J Sun et al.)A Bibliography on Network Flow Problems (M Veldhorst)Tabu Search: Applications and Prospects (S Voß)The Shortest Path Network and Its Applications in Bicriteria Shortest Path Problems (G-L Xue & S-Z Sun)A Network Formalism for Pure Exchange Economic Equilibria (L Zhao & A Nagurney)Steiner Problem in Multistage Computer Networks (S Bhattacharya & B Dasgupta) Readership: Applied mathematicians. keywords:“This volume reflects the wide spectrum of recent research activities in the design and analysis of algorithms and the applications of networks.”Journal of Global Optimization

## Network Optimization

Problems in network optimization arise in all areas of technology and industrial management. The topic of network flows has applications in diverse fields such as chemistry, engineering, management science, scheduling and transportation, to name a few. Network Optimization introduces the subject to undergraduate and graduate students in computer science, mathematics and operations research. The focus is mainly on developing the mathematical underpinnings of the techniques that make it possible to solve the several optimization problems covered in the text. The text discusses such topics as optimal branching problems, transshipment problems, shortest path problems, minimum cost flow problems, maximum flow problems, matching in bipartite and nonbipartite graphs and many applications to combinatorics. Also included is a large number of exercises.

## Stochastic Network Optimization with Application to Communication and Queueing Systems

This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future. Topics in the text include the following: - Queue stability theory - Backpressure, max-weight, and virtual queue methods - Primal-dual methods for non-convex stochastic utility maximization - Universal scheduling theory for arbitrary sample paths - Approximate and randomized scheduling theory - Optimization of renewal systems and Markov decision systems Detailed examples and numerous problem set questions are provided to reinforce the main concepts. Table of Contents: Introduction / Introduction to Queues / Dynamic Scheduling Example / Optimizing Time Averages / Optimizing Functions of Time Averages / Approximate Scheduling / Optimization of Renewal Systems / Conclusions

## Linear Network Optimization

*Algorithms and Codes*

## Network Optimization

*5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011, Proceedings*

## Time-Varying Network Optimization

This text describes a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read – and used – separately.