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, B. H. (Bernhard H.)
    name part: 1938-
    role:
      role term: creator
  name:
    name part: Vygen, Jens.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  genre: bibliography
  genre: Electronic books.
  origin info:
    place:
      place term: gw
    date issued: 2002
    edition: Second edition.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource (xiii, 530 pages) : illustrations.
  abstract: "This textbook on combinatorial optimization puts 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. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book 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. For the second edition several corrections and many updates have been made in the text."--BOOK JACKET.
  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.
  note: Bernhard Korte, Jens Vygen.
  note: Includes bibliographical references and indexes.
  subject:
    topic: Combinatorial optimization
  subject:
    topic: Optimización combinatoria
  subject:
    topic: Optimaliseren
  subject:
    topic: Combinatieleer
  subject:
    topic: Mathematische programmering
  subject:
    topic: Algoritmen
  subject:
    topic: Combinatorial optimization
  classification: QA402.5 .K6665 2002eb
  classification: 519.3
  classification: 31.12
  related item:
    title info:
      title: Combinatorial optimization
    name:
      name part: Korte, B. H. (Bernhard H.), 1938-
    origin info:
      edition: Second edition
    identifier: (DLC) 2002017038
    identifier: (OCoLC)49798314
  related item:
    title info:
      title: Algorithms and combinatorics ; 21
  identifier: 9783662217115 (electronic bk.)
  identifier: 3662217112 (electronic bk.)
  identifier: 3540431543
  identifier: 9783540431541
  identifier: http://proxy.library.tamu.edu/login
  record info:
    record content source: GW5XE
    record creation date: 140711
    record change date: 20260422201800.6
    record identifier: in00003548784
    language of cataloging:
      language term: eng