combinatorial optimization von cook (26 Ergebnisse)

Hardcover. Zustand: Very Good. First Edition. Publisher's hardback in very good condition: firm, square and tight with no snags or splits, just a trifle rubbed. Contents sound and clean; no pen-marks, just a former owner name at the endpaper. Not from a library so no such stamps or labels. Thus a tidy book in presentable condition.

Hardcover. Zustand: Very Good. First Edition. A better than very good hardback copy: firm, clean, square and tight with no underlining or splits. Just a former owner name at the endpaper.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. xviii + 562.

Zustand: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.

Hardcover. Zustand: Sehr gut. Bonn 2008. Berlin, Springer (2009). gr.8°. XVIII, 562 p. Hardbound. Six signatures and one dedication by authors in content.- Name on flyleaf.

Kartoniert / Broschiert. Zustand: New.

Zustand: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Zustand: Very good.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27-29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti c program of IPCO 2002. The selection was based on originality and quality, and re ects many of the current directions in integer programming and combinatorial optimization research.

Zustand: New. In.

Zustand: Gut. Zustand: Gut | Seiten: 504 | Sprache: Englisch | Produktart: Bücher | This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27¿29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

Zustand: New. In.

Gebunden. Zustand: New.

Zustand: New.

Hardcover. Zustand: Brand New. 1st edition. 562 pages. 9.50x6.50x1.25 inches. In Stock.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3-7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3-7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

Zustand: New. In.

Zustand: New. pp. 368.

Zustand: New. WILLIAM J. COOK is a professor in the Department of Computational and Applied Mathematics at Rice University. WILLIAM H. CUNNINGHAM is a professor in the Department of Combinatorics and Optimization at the University of Waterloo. WILLIAM R. PULLEYBLANK is D.

Hardcover. Zustand: Brand New. 1st edition. 355 pages. 10.00x6.75x1.00 inches. In Stock.

Zustand: New. A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Series: Wiley Series in Discrete Mathematics and Optimization. Num Pages: 368 pages, Illustrations. BIC Classification: PBU; PBW; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 243 x 167 x 26. Weight in Grams: 678. . 1997. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Neuware - A complete, highly accessible introduction to one of today's most exciting areas of applied mathematicsOne of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade.Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include:\* Network flow problems\* Optimal matching\* Integrality of polyhedra\* Matroids\* NP-completenessFeaturing logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

John Wiley & Sons, Inc. , New York, Chichester, . - 1998, Wiley-Interscience Series in Discrete Mathematics and Optimization, 16x24 cm, relié, X + 358 pages très bon état - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.