Optimization algorithms for networks and graphs. (2017)

• Record Type: Book
• Other Names: Evans, James R (James Robert), 1950-; Minieka, Edward; Minieka, Edward
• 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 -- Appendix: Linear Programming -- 2. Computer Representation and Solution. 2.1. Introduction and Examples. 2.2. Data Structures for Networks and Graphs. 2.3. Algorithms. 2.4. Computational Complexity. 2.5. Heuristics -- Appendix: NETSOLVE--An Interactive Software Package for Network Analysis -- 3. Tree Algorithms. 3.1. Introduction and Examples. 3.2. Spanning Tree Algorithms. 3.3. Variations of the Minimum Spanning Tree Problem. 3.4. Branchings and Arborescences -- Appendix: Using NETSOLVE to Find Minimum Spanning Trees -- 4. Shortest-Path Algorithms. 4.1. Introduction and Examples. 4.2. Types of Shortest-Path Problems and Algorithms. 4.3. Shortest Paths from a Single Source. 4.4. All Shortest-Path Algorithms. 4.5. The k-Shortest-Path Algorithm. 4.6. Other Shortest Paths -- Appendix: Using NETSOLVE to Solve Shortest-Path Problems. 5. Minimum-Cost Flow Algorithms. 5.1. Introduction and Examples. 5.2. Basic Properties of Minimum-Cost Network Flow Problems. 5.3. Combinatorial Algorithms for Minimum-Cost Network Flows. 5.4. The Simplex Method for Minimum-Cost Network Flows. 5.5. The Transportation Problem. 5.6. Flows with Gains -- Appendix: Using NETSOLVE to Find Minimum-Cost Flows -- 6. Maximum-Flow Algorithms. 6.1. Introduction and Examples. 6.2. Flow-Augmenting Paths. 6.3. Maximum-Flow Algorithm. 6.4. Extensions and Modifications. 6.5. Preflow-Push Algorithms for Maximum Flow. 6.6. Dynamic Flow Algorithms -- Appendix: Using NETSOLVE to Find Maximum Flows -- 7. Matching and Assignment Algorithms. 7.1. Introduction and Examples. 7.2. Maximum-Cardinality Matching in a Bipartite Graph. 7.3. Maximum-Cardinality Matching in a General Graph. 7.4. Maximum-Weight Matching in a Bipartite Graph: The Assignment Problem. 7.5. Maximum-Weight Matching Algorithm -- Appendix: Using NETSOLVE to Find Optimal Matchings and Assignments. 8. The Postman and Related Arc Routing Problems. 8.1. Introduction and Examples. 8.2. Euler Tours. 8.3. The Postman Problem for Undirected Graphs. 8.4. The Postman Problem for Directed Graphs. 8.5. The Postman Problem for Mixed Graphs. 8.6. Extensions to the Postman Problem -- 9. The Traveling Salesman and Related Vertex Routing Problems. 9.1. Introduction and Examples. 9.2. Basic Properties of the Traveling Salesman Problem. 9.3. Lower Bounds. 9.4. Optimal Solution Techniques. 9.5. Heuristic Algorithms for the TSP. 9.6. Vehicle Routing Problems -- Appendix: Using NETSOLVE to Find Traveling Salesman Tours -- 10. Location Problems. 10.1. Introduction and Examples. 10.2. Classifying Location Problems. 10.3. Mathematics of Location Theory. 10.4. Center Problems. 10.5. Median Problems. 10.6. Extensions -- 11. Project Networks. 11.1. Introduction and Examples. 11.2. Constructing Project Networks. 11.3. Critical Path Method. 11.4. Generalized Project Networks. Appendix: Using NETSOLVE to Find Longest Paths -- Netsolve User's Manual.
• Edition: 2nd ed., rev. and expanded
• Publisher Details: Place of publication not identified : Routledge
• Publication Date: 2017
• Extent: 1 online resource (488 pages)
• Subjects: 658.4/032; Graph theory; Network analysis (Planning); Algorithms; Graphes, Théorie des; Analyse de réseau (Planification); Algorithmes; Algorithms; Graph theory; Network analysis (Planning); Optimaliseren; Algoritmen; Grafen; Netwerken; Algorithmus; Diskette; Graph; Netz; Optimierung; Netz
• Languages: English
• ISBNs: 9781351426671; 1351426672
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.