• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Combinatorial Optimization Volume 1, Concepts of Combinatorial Optimization

Thumbnail
Date
2010
Publisher
Wiley-VCH
Publishing date
2010
ISBN:
978-1-84821-147-6
Dewey
Recherche opérationnelle
Sujet
combinatorial optimization
URI
https://basepub.dauphine.fr/handle/123456789/4503
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Paschos, Vangelis
Type
Ouvrage
Item number of pages
368
Abstract (EN)
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. 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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.