Loading…
Iterative Methods in Combinatorial Optimization.
A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization.
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Other Authors: | , |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
Leiden :
Cambridge University Press,
2011.
|
| Series: | Cambridge texts in applied mathematics.
|
| Subjects: | |
| Online Access: | Texto completo |
Table of Contents:
- Cover; Half-title; Series-title; Title; Copyright; Contents; Preface; 1 Introduction; 2 Preliminaries; 3 Matching and vertex cover in bipartite graphs; 4 Spanning trees; 5 Matroids; 6 Arborescence and rooted connectivity; 7 Submodular flows and applications; 8 Network matrices; 9 Matchings; 10 Network design; 11 Constrained optimization problems; 12 Cut problems; 13 Iterative relaxation: Early and recent examples; 14 Summary; Bibliography; Index.