Combinatorial optimization: Polyhedra and efficiency Alexander Schrijver

By:

Series: Algorithms and combinatorics ; vol. 24Publication details: Berlin ; New York: Springer, c2003Description: 3 v. (xxxvii, 1881 p.),+,1 CD 24 cmISBN:

Subject(s):

DDC classification:

LOC classification:

Online resources:

Contents:

v. A. Paths, flows, matchings -- v. B. Matroids, trees, stable sets -- v. C. Disjoint paths, hypergraphs.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Vol info	Copy number	Status	Date due	Barcode
Carti	IMAR	519.64-SCH-1 (Browse shelf(Opens below))	vol A: Paths, Flows, Matchings	1	Checked out	04/18/2025	0034003
Carti	IMAR	519.64-SCH-2 (Browse shelf(Opens below))	vol B: Matroids, Trees, Stable Sets	1	Checked out	04/18/2025	0034004
Carti	IMAR	519.64-SCH (Browse shelf(Opens below))	vol C: Disjoint Paths, Hypergraphs	1	Available		0036008
Carti	IMAR	519.64-SCH-3 (Browse shelf(Opens below))	vol C: Disjoint Paths, Hypergraphs	1+1CD	Checked out	04/18/2025	0034005

eng

Volumul C: Disjoint Paths, Hypergraphs cuprinde si 1 CD, cu acelasi nr de inventar

v. A. Paths, flows, matchings -- v. B. Matroids, trees, stable sets -- v. C. Disjoint paths, hypergraphs.

There are no comments on this title.

to post a comment.