combinatorial optimization polyhedra efficiency de schrijver alexander (8 resultados)

Hardcover. Condición: Sehr gut. Bln., Springer 2003. gr.8°. XXXVII, 647; XXXIV p., 1 leaf, p. 651-1217, XXXIII p. 1 leaf, p. 1221-1881. Hardbound in slip case. Algorithms and Combinatorics, 24.- A: Paths, Flows, Matchings. B: Matroids, Trees, Stable Sets. C: Disjoint Paths, Hypergraphs.- Very few pages with small dog ears.

Gebundene Ausgabe. Condición: Sehr gut. Gebraucht - Sehr gut achtung: nur band b!!! volume b only!!! - leichte beschädigungen oder verschmutzungen, ungelesenes mängelexemplar, gestempelt - This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Condición: Very Good. 1st Edition. Used book that is in excellent condition. May show signs of wear or have minor defects.

Condición: Good. 1st Edition. Used book that is in clean, average condition without any missing pages.

Ensayo. Matemáticas. Ciencia. Berlin. Colección: Algorithms and Combinatorics. Nº: 24(A, B y C). Editorial: Springer-Verlag. 2003. No indica edición. 1881 pags. 24x16 cms. Cartoné editorial. Muy buen estado.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

Hardcover. Condición: Brand New. 1st edition. 1800 pages. German language. 9.75x6.25x5.00 inches. In Stock.

cd_rom. Condición: Like New. Like New. book.