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 s
Iterative Methods in Combinatorial Optimization
โ Scribed by Lap-Chi Lau, R. Ravi, Mohit Singh
- Publisher
- Cambridge University Press
- Year
- 2011
- Tongue
- English
- Leaves
- 256
- Series
- Cambridge Texts in Applied Mathematics
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 s
This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality, and while it provides pointe