Narrow your search

Library

LUCA School of Arts (1)

Odisee (1)

Thomas More Kempen (1)

Thomas More Mechelen (1)

UCLL (1)

ULB (1)

ULiège (1)

VIVES (1)

VUB (1)


Resource type

book (1)


Language

English (1)


Year
From To Submit

2011 (1)

Listing 1 - 1 of 1
Sort by

Book
Iterative methods in combinatorial optimization
Authors: --- ---
ISBN: 9780521189439 9781107007512 0521189438 1107007518 9780511977152 9781139081078 1139081071 9781139078801 1139078801 0511977158 9781283111164 1283111160 1107221773 9786613111166 1139076523 1139083341 1139070800 9781107221772 6613111163 9781139076524 9781139083348 9781139070805 Year: 2011 Publisher: Cambridge ; New York : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

"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"--

Listing 1 - 1 of 1
Sort by