| Vorliegende Sprache |
eng |
| ISBN |
978-1-4419-5512-8 |
| Name |
Sierksma, Gerard |
| Ghosh, Diptesh |
| ANZEIGE DER KETTE |
Ghosh, Diptesh |
| T I T E L |
Networks in Action |
| Zusatz zum Titel |
Text and Computer Exercises in Network Optimization |
| Verlagsort |
Boston, MA |
| Verlag |
Springer Science+Business Media, LLC |
| Erscheinungsjahr |
2010 |
| 2010 |
| Umfang |
Online-Ressource (XI, 184 p. 96 illus, digital) |
| Reihe |
International Series in Operations Research & Management Science ; 140 |
| Notiz / Fußnoten |
Literaturverz. S. 181 - 182 |
| Weiterer Inhalt |
""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"" |
| Titelhinweis |
Buchausg. u.d.T.ISBN: 978-1-441-95512-8 |
| ISBN |
ISBN 978-1-4419-5513-5 |
| Klassifikation |
KJMD |
| KJT |
| BUS049000 |
| *90-02 |
| 90B10 |
| 90B15 |
| 90B18 |
| 90C35 |
| 658.40301 |
| 658.5 |
| HD30.23 |
| Kurzbeschreibung |
The Modeling and Implementing Process -- Network Theory -- References with Comments -- Shortest Paths -- Minimum Spanning Trees -- Network Flows -- Matchings -- Facility Location -- Cyclic Routing on Networks -- Erratum |
| 2. Kurzbeschreibung |
Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because data sets are missing or they’re just too large to handle in the classroom. Networks in Action: Text and Computer Exercises in Network Optimization contains a wide range of not-too-large network optimization problems that need to be analyzed and solved by using the computer. Using case studies based on a single fictitious company throughout, the book presents exercises in each chapter that are at once small enough to solve in the classroom, while too large to be solved by eye. After providing an overview of the modeling and implementing process, a look at network theory, and comprehensive listing of references with comments, the book looks shortest paths, minimum spanning trees, network flows, matchings, facility location, and cyclic routing on networks. Each chapter contains exercises that have been rigorously classroom-tested. The result is a perfect text for a one-semester course on network optimization, whether at the advanced undergraduate or the graduate level within an operations research program, econometrics, or as part of an MBA program |
| SWB-Titel-Idn |
327003057 |
| Signatur |
Springer E-Book |
| Bemerkungen |
Elektronischer Volltext - Campuslizenz |
| Elektronische Adresse |
$uhttp://dx.doi.org/10.1007/978-1-4419-5513-5 |
| Internetseite / Link |
Volltext |
| Siehe auch |
Volltext |
| Siehe auch |
Inhaltsverzeichnis |
| Siehe auch |
Einführung/Vorwort |
| Siehe auch |
Inhaltstext |
