Combinatorial optimization /
Combinatorial optimization /
edited by Vangelis Th. Paschos.
- London : ISTE :;Wiley, -2010
- v. <2> : ill. 25 cm.
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.
9781848211483 (v. 2)
Combinatorial optimization.
Programming (Mathematics)
QA 402.5 / .C733 2010
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.
9781848211483 (v. 2)
Combinatorial optimization.
Programming (Mathematics)
QA 402.5 / .C733 2010
