Networks in Action : Text and Computer Exercises in Network Optimization
by Gerard Sierksma, Diptesh Ghosh
| Year of publication: |
2010
|
|---|---|
| Authors: | Sierksma, Gerard |
| Other Persons: | Ghosh, Diptesh (contributor) |
| Publisher: |
Boston, MA : Springer Science+Business Media, LLC |
| Subject: | Unternehmensnetzwerk | Business network | Netzwerk | Network | Theorie | Theory | Soziales Netzwerk | Social network | Computerunterstützung | Computerized method |
| Description of contents: | Table of Contents [swbplus.bsz-bw.de] ; Table of Contents [gbv.de] ; Description [swbplus.bsz-bw.de] ; Description [zbmath.org] |
| Extent: | Online-Ressource (XI, 184 p. 96 illus, digital) |
|---|---|
| Series: | |
| Type of publication: | Book / Working Paper |
| Language: | English |
| Notes: | Literaturverz. S. 181 - 182 ""Networks in Action""; ""Preface""; ""Contents""; ""The Modeling and Implementing Process""; ""Network Theory""; ""Graphs and Networks""; ""Solution Techniques""; ""Graph Representations""; ""References with Comments""; ""Shortest Paths""; ""1.1 Introduction""; ""1.2 Applications""; ""1.2.1 Scheduling truck movement through cities""; ""1.2.2 Making investment plans""; ""1.3 A Linear Programming Formulation""; ""1.4 Algorithms for Shortest Path Problems""; ""1.4.1 Dijkstra�s algorithm""; ""1.4.2 Bellman-Ford�s algorithm""; ""1.5 Other Path Problems""; ""1.5.1 The longest path problem"" ""1.5.2 The bottleneck shortest path problem""""1.5.3 The hop-constrained shortest path problem""; ""1.5.4 The Hamiltonian path problem""; ""1.5.5 The stochastic shortest path problem""; ""1.6 Exercises on Shortest Path Problems""; ""Minimum Spanning Trees""; ""2.1 Introduction""; ""2.2 Applications""; ""2.2.1 Designing networks for disasters""; ""2.2.2 Group technology""; ""2.2.3 Storing large but similar data""; ""2.3 Linear Programming Formulations""; ""2.4 Algorithms for Minimum Spanning Trees""; ""2.4.1 Prim�s algorithm""; ""2.4.2 Kruskal�s algorithm""; ""2.5 Other Tree Problems"" ""2.5.1 The Steiner tree problem""""2.5.2 The capacitated minimum spanning tree problem""; ""2.5.3 The degree constrained minimum spanning tree problem""; ""2.5.4 The most reliable minimum spanning tree problem""; ""2.6 Exercises on Minimum Spanning Tree Problems""; ""Network Flows""; ""3.1 Introduction""; ""3.2 Applications""; ""3.2.1 Production planning""; ""3.2.2 Tourist reservation system""; ""3.2.3 Staff allocation""; ""3.3 Linear Programming Formulations""; ""3.4 Algorithms for Network Flow Problems""; ""3.4.1 Ford-Fulkerson�s algorithm""; ""3.5 Other Network Flow Problems"" ""3.5.1 The multicommiodity flow problem""""3.5.2 The reliable network flow problem""; ""3.5.3 The network cut problem""; ""3.6 Exercises on Network Flow Problems""; ""Matchings""; ""4.1 Introduction""; ""4.2 Applications""; ""4.2.1 Constructing university timetables""; ""4.2.2 Constructing 3-dimensional models from 2-dimensional data""; ""4.2.3 Crew pairing""; ""4.3 Linear Programming Formulations""; ""4.3.1 The maximum cardinality matching problem""; ""4.3.2 The maximum weight matching problem""; ""4.3.3 The non-bipartite matching problem""; ""4.3.4 The bottleneck matching problem"" ""4.4 Algorithms for Matchings""""4.5 Other Matching Problems""; ""4.5.1 The stable marriage problem""; ""4.5.2 The 3-dimensional stable matching problem""; ""4.6 Exercises on Matching Problems""; ""Facility Location""; ""5.1 Introduction""; ""5.2 Applications""; ""5.2.1 Cluster analysis""; ""5.2.2 Locating undesirable facilities""; ""5.3 Linear Programming Formulations""; ""5.3.1 The uncapacitated facility location problem""; ""5.3.2 The capacitated facility location problem""; ""5.3.3 The p-median problem""; ""5.3.4 The p-center problem""; ""5.4 Algorithms for Location Problems"" ""5.4.1 An exact algorithm: Branch and bound"" |
| ISBN: | 978-1-4419-5513-5 ; 978-1-4419-5512-8 |
| Other identifiers: | 10.1007/978-1-4419-5513-5 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013522739