Amazon cover image
Image from Amazon.com
Image from OpenLibrary

Combinatorial optimization: theory and algorithms/ Bernhard Korte, Jens Vygen.

By: Contributor(s): Series: Algorithms and combinatorics ; 21Publication details: Berlin; New York: Springer, c2002.Edition: 2nd edDescription: xiii, 530 p.: ill.; 25 cmISBN:
  • 3540431543
Subject(s): DDC classification:
  • 519.3 K85c
Online resources:
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 .
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode
Books Books Castorina Estantes Abertas (Open Shelves) Livros (Books) 519.3 K85c 2002 IMPA (Browse shelf(Opens below)) 1 Available 39063000583560

Includes bibliographical references and indexes.

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 .

There are no comments on this title.

to post a comment.
© 2023 IMPA Library | Customized & Maintained by Sérgio Pilotto


Powered by Koha