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...
Gespeichert in:
1. Verfasser: | |
---|---|
Weitere Verfasser: | , |
Format: | UnknownFormat |
Sprache: | eng |
Veröffentlicht: |
Cambridge
Cambridge University Press
2011
|
Schriftenreihe: | Cambridge texts in applied mathematics
|
Schlagworte: | |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Keine Ergebnisse!