Concepts combinatorial optimization (41 Ergebnisse)

Zustand: New.

Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization paradigms. It begins by introducing readers to general results for interval, discrete, and budgeted uncertainty sets, and subsequently provides a comprehensive examination of specific combinatorial problems, including the selection, shortest path, spanning tree, assignment, knapsack, and traveling salesperson problems.The book equips both students and newcomers to the field with a grasp of the fundamental questions and ongoing advancements in robust optimization. Based on the authors' years of teaching and refining numerous courses, it not only offers essential tools but also highlights the open questions that define this subject area.…

Hardcover. Zustand: Brand New. 320 pages. 9.25x6.10x9.49 inches. In Stock.

Zustand: new.

Taschenbuch. Zustand: Neu. An Introduction to Robust Combinatorial Optimization | Concepts, Models and Algorithms for Decision Making under Uncertainty | Marc Goerigk (u. a.) | Taschenbuch | xii | Englisch | 2025 | Springer | EAN 9783031612633 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

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

Zustand: New.

Zustand: New. pp. 368.

Zustand: As New. Unread book in perfect condition.

Zustand: New. pp. 368.

Zustand: New.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book offers a self-contained introduction to the world of robust combinatorial optimization. It explores decision-making using the min-max and min-max regret criteria, while also delving into the two-stage and recoverable robust optimization paradigms. It begins by introducing readers to general results for interval, discrete, and budgeted uncertainty sets, and subsequently provides a comprehensive examination of specific combinatorial problems, including the selection, shortest path, spanning tree, assignment, knapsack, and traveling salesperson problems.The book equips both students and newcomers to the field with a grasp of the fundamental questions and ongoing advancements in robust optimization. Based on the authors' years of teaching and refining numerous courses, it not only offers essential tools but also highlights the open questions that define this subject area.…

Zustand: New. 2024th edition NO-PA16APR2015-KAP.

Zustand: New. In English.

Hardback. 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 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.…

Hardcover. Zustand: Brand New. 320 pages. 9.25x6.10x9.49 inches. In Stock.

Zustand: New. pp. 416.

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 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. . . . .…

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 aims to cover a wide range of topics in this area. Editor(s): Paschos, Vangelis Th. Num Pages: 380 pages. BIC Classification: PBU. Category: (P) Professional & Vocational. Dimension: 235 x 162 x 27. Weight in Grams: 700. . 2010. 1st Edition. Hardcover. . . . .…

Gebunden. 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 .

Zustand: New. Brand new! Please provide a physical shipping address.

Zustand: New. pp. 416.

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 aims to cover a .

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.…