Show simple item record

dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2010-06-30T12:41:15Z
dc.date.available2010-06-30T12:41:15Z
dc.date.issued2010
dc.identifier.isbn978-1-84821-148-3en
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/4504
dc.language.isoenen
dc.subjectcombinatorial optimizationen
dc.subject.ddc003en
dc.titleCombinatorial optimization Volume 2, Paradigms of Combinatorial Optimization: problems and new approachesen
dc.typeOuvrage
dc.description.abstractenCombinatorial 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.
dc.publisher.nameWiley-VCHen
dc.identifier.citationpages704en
dc.description.sponsorshipprivateouien
dc.subject.ddclabelRecherche opérationnelleen
dc.identifier.citationdate2010


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record