 |
|
| HANDBOOKS IN OPERATIONS RESEARCH AND MANAGEMENT SCIENCE, 7: NETWORK MODELS
| |
| | |
|
|
Buy online with a credit card in the Elsevier Science & Technology Bookstore:  http://books.elsevier.com/elsevier/?isbn=0444892923
Edited by
M.O. Ball, University of Maryland, College Park, MD, USA
T.L. Magnanti, Massachusetts Institute of Technology, Cambridge, MA, USA
C.L. Monma, Bellcore, Morristown, NJ, USA
G.L. Nemhauser, Georgia Institute of Technlogy, Atlanta, GA, USA
Included in series
Handbooks in Operations Research and Management Science, 7
Description
The set of papers in this Handbook reflect the rich theory and wide range of applications of network models. Two of the most vibrant applications
areas of network models are telecommunications and transportation. Several chapters explicitly model issues arising in these problem
domains. Research on network models has been closely aligned with the field of computer science both in developing data structures for
efficiently implementing network algorithms and in analyzing the complexity of network problems and algorithms. The basic structure underlying
all network problems is a graph. Thus, historically, there have been strong ties between network models and graph theory.
A companion
volume in the Handbook series, entitled Network Routing, examines problems related to the movement of commodities over a network.
The problems treated arise in several application areas including logistics, telecommunications, facility location, VLSI design, and
economics.
Contents
Applications of Network Optimization
(R.K. Ahuja et al.). Preliminaries. Shortest paths. Maximum flows. Minimum cost flows.
The assignment problem. Matchings. Minimum spanning trees. Convex cost flows. Generalized flows. Multicommodity flows. The travelling
salesman problem. Network design.
Primal Simplex Algorithms for Minimum Cost Network Flows
(R.V. Helgason, J.L. Kennington). Primal
simplex algorithm. Linear network models. Generalized networks. Multicommodity networks. Networks with side constraints.
Matching
(A.M.H. Gerards). Finding a matching of maximum cardinality. Bipartite matching duality. Non-bipartite matching duality. Matching and
integer and linear programming. Finding maximum and minimum weight matchings. General degree constraints. Other matching algorithms.
Applications of matchings. Computer implementations and heuristics.
The Travelling Salesman Problem
(M. Jünger, G. Reinelt,
G. Rinaldi). Related problems. Practical applications. Approximation algorithms for the TSP. Relaxations. Finding optimal and provably
good solutions. Computation.
Parallel Computing in Network Optimization
(D. Bertsekas et al.). Linear network optimization.
Nonlinear network optimization.
Probabilistic Networks and Network Algorithms
(T.L. Snyder, J.M. Steele). Probability theory of
network characteristics. Probabilistic network algorithms. Geometric networks.
A Survey of Computational Geometry
(J.S.B. Mitchell,
S. Suri). Fundamental structures. Geometric graphs. Path planning. Matching, travelling salesman, and watchman routes. Shape analysis,
computer vision, and pattern matching.
Algorithmic Implications of the Graph Minor Theorem
(D. Bienstock, M.A. Langston). A brief
outline of the graph minors project. Treewidth. Pathwidth and cutwidth. Disjoint paths. Challenges to practicality.
Optimal Trees
(T.L. Magnanti, L.A. Wolsey). Tree optimization problems. Minimum spanning trees. Rooted subtrees of a tree. Polynomially solvable extensions/variations.
The Steiner tree problem. Packing subtrees of a tree. Packing subtrees of a general graph. Trees-on-trees.
Design of Survivable Networks
(M. Grötschel, C.L. Monma, M. Stoer). Overview. Motivation. Integer programming models of survivability. Structural properties and
heuristics. Polynomially solvable special cases. Polyhedral results. Computational results. Directed variants of the general model.
Network
Reliability
(M.O. Ball, C.J. Colbourn, J.S. Provan). Motivation. Computational complexity and relationships among problems. Exact
computation of reliability. Bounds on network reliability. Monte Carlo methods. Performability analysis and multistate network systems.
Using computational techniques in practice.
Biographical Information. Subject Index. Contents of Previous Volumes.
| Bibliographic details |
Hardbound, 798 pages, publication date: MAY-1995
ISBN-13: 978-0-444-89292-8
ISBN-10: 0-444-89292-3
Imprint: NORTH-HOLLAND
|
| Price and Ordering |
Price:
EUR 188
GBP 125
USD 188
|  |
Subscription price:
USD 152
EUR 152
| |
Membership price:
USD 99
USD 99
| |
Books and book related electronic products are priced in US dollars (USD), euro (EUR), and Great Britain Pounds (GBP). USD prices apply to the Americas and Asia Pacific. EUR prices apply in Europe and the Middle East. GBP prices apply to the UK and all other countries.
|
See also information about conditions of sale & ordering procedures, and links to our regional sales offices.
|
081/861
Last update: 12 Jun 2009
|
|
| |
| | |
|
|
| |
Home | Elsevier Websites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company