|
|
|
|
| LEADER |
03660nmm a2200349 u 4500 |
| 001 |
EB000666800 |
| 003 |
EBX01000000000000000519882 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642591792
|
| 100 |
1 |
|
|a Pardalos, Panos M.
|e [editor]
|
| 245 |
0 |
0 |
|a Network Optimization
|h Elektronische Ressource
|c edited by Panos M. Pardalos, Donald W. Hearn, William W. Hager
|
| 250 |
|
|
|a 1st ed. 1997
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1997, 1997
|
| 300 |
|
|
|a VIII, 488 p. 4 illus
|b online resource
|
| 505 |
0 |
|
|a A Pavement Network Optimization System Using Dantzig-Wolfe Decomposition -- Integer Multicommodity Flow Problems -- Solution Methods for Nonconvex Network Flow Problems -- Congestion Toll Pricing of Traffic Networks -- Solving the Nonadditive Traffic Equilibrium Problem -- ?-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems -- A Communication Assignment Problem on Trees: Heuristics and Asymptotic behavior -- The Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs -- Distributed Disaggregate Simplicial Decomposition ? A Parallel Algorithm for Traffic Assignment -- Computation of Constrained Spanning Trees: A Unified Approach -- Two Special Cases for Rectilinear Steiner Minimum Trees -- Decomposition Methods for Network Optimization Problems in the Presence of Uncertainty -- Network Methods for Head-dependent Hydro Power Scheduling -- An Efficient Implementation of the Network Simplex Method -- Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets -- NET SPEAK: An Algebraic Modelling Language for Nonconvex Network Optimization Problems -- Applications of Simplicial Decomposition with Nonlinear Column Generations to Nonlinear Network Flows -- Massively Parallel Computation of Dynamic Traffic Networks Modeled as Projected Dynamical Systems -- Solving the Survivable Network Design Problem with Search Space Smoothing -- Track Initiation and Maintenance Using Multidimensional Assignment Problems -- An Optimal Control Formulation of Large-Scale Multiclass Machine Scheduling Problems -- Interior Point Methods for Supervised Training of Artificial Neural Networks with Bounded Weights -- Approximate Lagrangian Decomposition with a Modified Karmarkar Logarithmic Potential
|
| 653 |
|
|
|a Computer Communication Networks
|
| 653 |
|
|
|a Operations research
|
| 653 |
|
|
|a Application software
|
| 653 |
|
|
|a Computer networks
|
| 653 |
|
|
|a Computer and Information Systems Applications
|
| 653 |
|
|
|a Operations Research and Decision Theory
|
| 700 |
1 |
|
|a Hearn, Donald W.
|e [editor]
|
| 700 |
1 |
|
|a Hager, William W.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Economics and Mathematical Systems
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-59179-2
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-59179-2?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 658.403
|
| 520 |
|
|
|a 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
|