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.
  name:
    name part: Vygen, Jens.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2008
    edition: Fourth Edition.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVIII, 627 p. 77 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 has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. 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), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054.
  table of contents: Graphs -- Linear Programming -- Linear Programming Algorithms -- Integer Programming -- Spanning Trees and Arborescences -- Shortest Paths -- Network Flows -- Minimum Cost Flows -- Maximum Matchings -- Weighted Matching -- b-Matchings and T-Joins -- Matroids -- Generalizations of Matroids -- NP-Completeness -- Approximation Algorithms -- The Knapsack Problem -- Bin-Packing -- Multicommodity Flows and Edge-Disjoint Paths -- Network Design Problems -- The Traveling Salesman Problem -- Facility Location.
  note: by Bernhard Korte, Jens Vygen.
  subject:
    topic: Mathematics
  subject:
    topic: Operations research
  subject:
    topic: Decision making
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Mathematical models
  subject:
    topic: Calculus of variations
  subject:
    topic: Discrete mathematics
  subject:
    topic: Combinatorics
  subject:
    topic: Mathematics
  subject:
    topic: Discrete Mathematics
  subject:
    topic: Mathematical Modeling and Industrial Mathematics
  subject:
    topic: Combinatorics
  subject:
    topic: Calculus of Variations and Optimal Control; Optimization
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Operation Research/Decision Theory
  classification: QA150-272
  classification: 511.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Algorithms and Combinatorics, 21
  identifier: 9783540718444
  identifier: http://dx.doi.org/10.1007/978-3-540-71844-4
  record info:
    record creation date: 100301
    record change date: 20151204145129.0
    record identifier: 978-3-540-71844-4