http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
1 online resource (viii, 485 pages) : illustrations
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.
From the contents: A Pavement Network Optimization Sytems Using Dantzig-Wolfe Decomposition -- Solution Methods for Nonconvex Network Flow Problems -- Solving the Nonadditive Traffic Equilibrium Problem -- A Communication Assignment Problem on Trees: Heuristics and Asymptotic Behavior -- Distributed Disaggregate Simplicial Decomposition - A Parallel Algorithm for Traffic Assignment -- Two Special Cased for Rectilinear Steiner Minimum Trees -- Network Methods for Head-dependent Hydro Power Scheduling -- Implementations of Dijkstra`s Algorithm Based on Multi-Level Buckets -- Applications of Simplicial Decomposition with Nonlinear Column Generators to Nonlinear Network Flows -- Solving the Survivable Network Design Problem with Search Space Smoothing -- An Optimal Control Formulation of Large-Scale Multiclass Machine Scheduling Problems -- Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential.
Panos M. Pardalos, Donald W. Hearn,William W. Hager, eds.
Papers from a conference held at the Center for Applied Optimization (University of Florida), Feb. 12-14, 1996.
Lecture notes in economics and mathematical systems ; 450