Show simple item record

dc.contributor.authorPaschos, Vangelis
dc.date.accessioned2010-06-30T12:37:45Z
dc.date.available2010-06-30T12:37:45Z
dc.date.issued2010
dc.identifier.isbn978-1-84821-147-6en
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/4503
dc.language.isoenen
dc.subjectcombinatorial optimizationen
dc.subject.ddc003en
dc.titleCombinatorial Optimization Volume 1, Concepts of Combinatorial Optimizationen
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. Concepts of Combinatorial Optimization, is divided into three parts: * On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity; * Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; * Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
dc.publisher.nameWiley-VCHen
dc.identifier.citationpages368en
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