Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 60,15
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Taschenbuch. Zustand: Neu. Integer Programming and Combinatorial Optimization | 5th International IPCO Conference Vancouver, British Columbia, Canada June 3-5, 1996 Proceedings | William H. Cunningham (u. a.) | Taschenbuch | x | Englisch | 1996 | Springer | EAN 9783540613107 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996.The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.
Zustand: Gut. Zustand: Gut | Seiten: 524 | Sprache: Englisch | Produktart: Bücher | This volume presents the proceedings of the Fifth Integer Programming and Combinatorial Optimization Conference, IPCO V, held in Vancouver, British Columbia, Canada, in June 1996.The 36 revised papers included in the book were selected from a total of 99 submissions; they highlight recent developments in theory, computation, and applications of integer programming and combinatorial optimization. The volume is organized in sections on integer programming theory and models, network flow algorithms, approximation algorithms, semi-definite methods, matrix models, set systems and submodularity, scheduling, probabilistic methods, polyhedral methods, and the traveling salesman problem.