Iterative methods in combinatorial optimization /
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 si...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge :
Cambridge University Press,
2011.
|
| Series: | Cambridge texts in applied mathematics ;
46. |
| Subjects: | |
| Online Access: | CONNECT |
