| Description |
1 online resource (481 pages) |
| Contents |
Cover -- Title Page -- Copyright page -- Preface to the Second Edition -- Preface to the First Edition -- Contents -- 1. Introduction to Graphs and Networks -- 1.1 Introduction and Examples -- 1.2 Some Essential Concepts and Definitions -- 1.3 Modeling with Graphs and Networks -- Offshore Pipeline Design -- Delivering Meals on Wheels -- Facility Layout -- Equipment Replacement -- Employment Scheduling -- Appendix: Linear Programming -- The Simplex Algorithm -- Basic Concepts and Theory -- Exercises -- References |
|
2. Computer Representation and Solution2.1 Introduction and Examples -- 2.2 Data Structures for Networks and Graphs -- Vertex (Node) Adjacency Matrix -- Vertex-Edge (Node-Arc) Incidence Matrix -- Edge (Arc) List -- Adjacency Lists -- 2.3 Algorithms -- 2.4 Computational Complexity -- 2.5 Heuristics -- Construction -- Improvement -- Partitioning and Decomposition -- Specialized Methods -- Appendix: Netsolve -An Interactive Software Package for Network Analysis -- Exercises -- References -- 3. Tree Algorithms -- 3.1 Introduction and Examples |
|
Rumor MongerHighway Construction -- Maximum-Capacity Route -- Group Technology -- 3.2 Spanning Tree Algorithms -- Spanning Tree Algorithm -- Minimum Spanning Tree Algorithm -- Maximum Spanning Tree Algorithm -- 3.3 Variations of the Minimum Spanning Tree Problem -- The Capacitated Minimum Spanning Tree (Chandy and Lo, 1973) -- Degree-Constrained Spanning Trees (Gabow, 1978; Glover and Klingman, 1974) -- Optimum Communication Spanning Trees (Hu, 1974) -- Steiner Trees -- 3.4 Branchings and Arborescences -- Maximum Branching Algorithm |
|
Appendix: Using Netsolve to Find Minimum Spanning TreesExercises -- References -- 4. Shortest-Path Algorithms -- 4.1 Introduction and Examples -- Transportation Planning -- Salesperson Routing -- Investment Planning -- Production Lot Sizing -- Knapsack Problem -- Routing Snow Removal Vehicles -- 4.2 Types of Shortest-Path Problems and algorithms -- 4.3 Shortest Paths from a Single Source -- Dijkstra's Shortest-Path Algorithm -- Ford's Algorithm -- Partitioning Algorithms -- Dijkstra's Two-Tree Algorithm -- 4.4 All Shortest-Path Algorithms |
|
Floyd Shortest-Path AlgorithmDantzig Shortest-Path Algorithm -- 4.5 The K-Shortest-Path Algorithm -- Double-Sweep Algorithm -- 4.6 Other Shortest Paths -- Appendix: Using Netsolve to Solve Shortest-Path Problems -- Exercises -- References -- 5. Minimum-Cost Flow Algorithms -- 5.1 Introduction and Examples -- Distribution -- Statistical Matching of Large Data Files (Ban and Turner, 1981 -- Production Scheduling (Bazaraa et al., 1990; Bowers and Jarvis, 1989) -- Determining Service Districts (Cooper, 1972; Larson and Odoni, 1981) -- Natural Gas Distribution |
| Notes |
""5.2 Basic Properties of Minimum-Cost Network Flow Problems"" |
|
Print version record |
| Subject |
Algorithms.
|
|
Computer algorithms.
|
|
algorithms.
|
|
Computer algorithms
|
|
Algorithms
|
| Form |
Electronic book
|
| Author |
Minieka, Edward
|
|
Minier, Edward
|
| ISBN |
9781351426671 |
|
1351426672 |
|
