IMIST


Vue normale Vue MARC vue ISBD

Iterative methods in combinatorial optimization

par Lau, Lap Chi.
Autres auteurs : Ravi, R. | Singh, Mohit.
Collection : Cambridge texts in applied mathematics Publié par : Cambridge University Press (Cambridge | New York) Détails physiques : xi, 242 pages illustrations 24 cm. ISBN :9781107007512 (hardback); 1107007518 (hardback); 9780521189439 (pbk.); 0521189438 (pbk.). Année : 2011
Tags de cette bibliothèque : Pas de tags pour ce titre. Connectez-vous pour ajouter des tags.
    Évaluation moyenne : 0.0 (0 votes)
Type de document Site actuel Cote Statut Date de retour prévue Code à barres Réservations
Livre La bibliothèque des Sciences Exactes et Naturelles
518.26 LAU (Parcourir l'étagère) Disponible 0000000023686
Total des réservations: 0

"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--

"With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms"--

Includes bibliographical references and index.

Il n'y a pas de commentaire pour ce document.

pour proposer un commentaire.
© Tous droits résérvés IMIST/CNRST
Angle Av. Allal Al Fassi et Av. des FAR, Hay Ryad, BP 8027, 10102 Rabat, Maroc
Tél:(+212) 05 37.56.98.00
CNRST / IMIST

Propulsé par Koha