Combinatorial optimization / edited by Vangelis Th. Paschos.
Material type:
TextPublication details: London : ISTE :;Wiley, -2010Description: v. <2> : ill. 25 cmISBN: - 9781848211483 (v. 2)
- QA 402.5 .C733 2010
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Reference
|
Aklatang Emilio Aguinaldo-Information Resource Center Reference | QA 402.5 .C733 2010 (Browse shelf(Opens below)) | Not for loan | 3AEA0000315768 |
Browsing Aklatang Emilio Aguinaldo-Information Resource Center shelves, Shelving location: Reference Close shelf browser (Hides shelf browser)
|
|
|
No cover image available |
|
|
|
||
| QA 276.14 .Ev27 2010 The Cambridge dictionary of statistics / | QA 276.2 .M139 2014 McGraw-Hill's 500 statistics questions : ace your college exams. | QA 276.4 .W428 2014 Foundations of statistical algorithms : with references to R packages / | QA 402.5 .C733 2010 Combinatorial optimization / | QA 431 .P768 2008 Handbook of integral equations / | QA 445.2 .G676 2003 The facts on file geometry handbook. / | QA 805 .K320i 2012 Industrial mechanics instructor's resource guide / |
Adapted and updated from Optimisation combinatoire volumes 1 to 5 published 2005-2007 in France by Hermes Science/Lavoisier--T.p. verso.
Includes bibliographical references and index.
v. 1. Concepts of combinatorial optimization -- v. 2. Paradigms of combinatorial optimization : problems and new approaches -- v. 3. Applications of combinatorial optimization.
Addresses the various paradigms and approaches taken in Combinatorial Optimization, is divided into two parts: 1. "Paradigmatic Problems", which discusses several famous combinatorial optimization problems such as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of Combinatorial Optimization as one of the most active current scientific domains. 2. "New Approaches", which presents the methodological approaches that fertilize and are fertilized by Combinatorial Optimization such as polynomial approximation, on-line computation, robustness, etc. and, more recently, algorithmic game theory.
There are no comments on this title.
