rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Combinatorial Optimization
    sub title: Theory and Algorithms
  name:
    name part: Korte, Bernhard.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: Vygen, Jens.
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2018
    edition: 6th ed. 2018.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XXI, 698 p. 78 illus. online resource.
  abstract: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005) "This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. "Combinatorial Optimization" can easily serve as an (almost) complete reference for current research and is state-of-the-art. [...]" Zentralblatt MATH 1237.90001 .
  table of 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.
  note: by Bernhard Korte, Jens Vygen.
  subject:
    topic: Combinatorics
  subject:
    topic: Calculus of variations
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Operations research
  subject:
    topic: Decision making
  subject:
    topic: Combinatorics
  subject:
    topic: Calculus of Variations and Optimal Control; Optimization
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Operations Research/Decision Theory
  classification: QA164-167.2
  classification: 511.6
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Algorithms and Combinatorics, 21
  identifier: 9783662560396
  identifier: https://doi.org/10.1007/978-3-662-56039-6
  record info:
    record creation date: 180313
    record change date: 20191029032036.0
    record identifier: 978-3-662-56039-6