Paradigms of Combinatorial Optimization
Problems and New Approaches, Volume 2
Inbunden, Engelska, 2010
Av Vangelis Th. Paschos, France) Paschos, Vangelis Th. (University of Paris-Dauphine, Vangelis Th Paschos
5 139 kr
Beställningsvara. Skickas inom 5-8 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.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. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. “Paradigms of Combinatorial Optimization” is divided in two parts:• Paradigmatic Problems, that handles several famous combinatorial optimization problems 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 the Combinatorial Optimization as one of the most active actual scientific domains;• Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.
Produktinformation
- Utgivningsdatum2010-07-16
- Mått158 x 236 x 46 mm
- Vikt1 179 g
- FormatInbunden
- SpråkEngelska
- Antal sidor687
- FörlagISTE Ltd and John Wiley & Sons Inc
- ISBN9781848211483