Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 162,99
Anzahl: 15 verfügbar
In den WarenkorbHRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 162,74
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 204,47
Anzahl: 3 verfügbar
In den WarenkorbZustand: New. pp. 416.
EUR 178,25
Anzahl: Mehr als 20 verfügbar
In den WarenkorbGebunden. Zustand: New. Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover .
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 237,21
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 2nd revised updated edition. 370 pages. 9.00x5.00x1.00 inches. In Stock.
Sprache: Englisch
Verlag: ISTE Ltd and John Wiley & Sons Inc, 2014
ISBN 10: 1848216564 ISBN 13: 9781848216563
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 258,00
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. Editor(s): Paschos, Vangelis Th. Num Pages: 416 pages, illustrations (black and white). BIC Classification: KJMD; PBU; UY. Category: (P) Professional & Vocational. Dimension: 243 x 164 x 27. Weight in Grams: 748. . 2014. 2nd Edition. Hardcover. . . . . Books ship from the US and Ireland.
Buch. Zustand: Neu. Neuware - Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.