VOORDEEL - 57% korting
,

Combinatorial Optimization

Algorithms and Complexity

Specificaties
Paperback, 528 blz. | Engels
Dover Publications | 1e druk, 1998
ISBN13: 9780486402581
Rubricering
Hoofdrubriek : Computer en informatica
Dover Publications 1e druk, 1998 9780486402581
35,61
10,95
Laatste exemplaren! Op=Op!
Laatste exemplaar! Voor 21:00 uur besteld, morgen in huis
VOORDEEL - 57% korting

Samenvatting

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more.

All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.

"Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.

Specificaties

ISBN13:9780486402581
Trefwoorden:Algoritmen
Taal:Engels
Bindwijze:paperback
Aantal pagina's:528
Druk:1
Verschijningsdatum:29-1-1998
Hoofdrubriek:IT-management / ICT

Rubrieken

    Personen

      Trefwoorden

        Combinatorial Optimization