Combinatorial optimization : theory and algorithms /: theory and algorithms. (2018)

• Record Type: Book
• Further Information: Note: Bernhard Korte, Jens Vygen.
• Authors: Korte, B. H (Bernhard H.), 1938-; Vygen, Jens
• Contents: 1 Introduction -- 2 Graphs -- 3 Linear Programming -- 4 Linear Programming Algorithms -- 5 Integer Programming -- 6 Spanning Trees and Arborescences -- 7 Shortest Paths -- 8 Network Flows -- 9 Minimum Cost Flows -- 10 Maximum Matchings -- 11 Weighted Matching -- 12 b-Matchings and T -Joins -- 13 Matroids -- 14 Generalizations of Matroids -- 15 NP-Completeness -- 16 Approximation Algorithms -- 17 The Knapsack Problem -- 18 Bin-Packing -- 19 Multicommodity Flows and Edge-Disjoint Paths -- 20 Network Design Problems -- 21 The Traveling Salesman Problem -- 22 Facility Location -- Indices.
• Edition: Sixth edition
• Publisher Details: Berlin, Germany : Springer
• Publication Date: 2018
• Extent: 1 online resource (xxi, 698 pages), illustrations
• Subjects: 519.6/4; Combinatorial optimization; Combinatorial optimization; Electronic books; Electronic books
• Languages: English
• ISBNs: 9783662560396; 3662560399
• Related ISBNs: 9783662560389
• Notes: Note: Includes bibliographical references and indexes.; Note: Online resource; title from PDF title page (SpringerLink, viewed March 20, 2018).
• 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.