Network OptimizationPanos M. Pardalos, Donald W. Hearn, William W. Hager Springer Science & Business Media, 6. des. 2012 - 488 sider 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. |
Innhold
| 1 | |
| 17 | |
Solution Methods for Nonconvex Network Flow Problems | 32 |
Congestion Toll Pricing of Traffic Networks | 51 |
Solving the Nonadditive Traffic Equilibrium Problem | 72 |
Bernstein S A Gabriel | 89 |
Relaxation and Auction Methods for Separable Convex | 103 |
Heuristics | 127 |
Network Methods for Headdependent Hydro Power | 249 |
An Efficient Implementation of the Network Simplex Method | 265 |
Implementations of Dijkstras Algorithm Based on MultiLevel | 292 |
An Algebraic Modelling Language for Nonconvex | 328 |
Applications of Simplicial Decomposition with Nonlinear | 346 |
Massively Parallel Computation of Dynamic Traffic Networks | 374 |
Solving the Survivable Network Design Problem with Search | 397 |
An Optimal Control Formulation of LargeScale Multiclass | 423 |
The Inverse Shortest Paths Problem with Upper Bounds | 156 |
Distributed Disaggregate Simplicial Decomposition A Parallel | 172 |
A Unified | 194 |
N Deo N Kumar | 217 |
Decomposition Methods for Network Optimization Problems | 234 |
Interior Point Methods for Supervised Training of Artificial | 441 |
Approximate Lagrangian Decomposition with a Modified | 471 |
J Villavicencio M D Grigoriadis | 485 |
Andre utgaver - Vis alle
Network Optimization Panos M. Pardalos,Donald W. Hearn,William W. Hager Ingen forhåndsvisning tilgjengelig - 2011 |
Vanlige uttrykk og setninger
admissible graph algorithm application approach approximation branch-and-bound CAP-T column compute constraints convergence convex cost functions CPLEX defined demand denote e-relaxation method edge efficient equilibrium Euler method feasible solutions formulation Frank-Wolfe given global grid heuristic implementation initial integer Lemma linear programming lower bound LP relaxation master problem Mathematical matrix minimize minimum NETSPEAK network flow network flow problems network simplex node nonlinear nonnegative NP-complete O/D pair objective function objective function value OD-pair optimal solution optimization problems parallel parameter path flows penalty performance prob procedure projected dynamical systems push list quadratic random relaxation road category RSMT search space Section sequence shortest paths problem simplicial decomposition simulated annealing solved spanning tree Steiner Steiner tree Step stochastic subproblem Table tabu list tabu search test problems Theorem track traffic assignment problem Transportation trust region update weights