Cargando…
Combinatorial optimization: theory and algorithms
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be...
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2002
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-3-662-21711-5 http://cds.cern.ch/record/1667157 |