Combinatorial Optimization: Algorithms and Complexity

Prijzen vanaf
19,54

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

Bol 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.

Vergelijk aanbieders (2)

Sorteren op:

€ 19,54 Gratis verzending

€ 25,69 € 20,44 € 2,99 verzendkosten Totaal € 23,43

Beschrijving (1)

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.


Productspecificaties

Merk Search Press Ltd
EAN
  • 9780486402581
Maat


Prijshistorie

* Prijshistorie bevat geen data van Amazon.

Prijzen voor het laatst bijgewerkt op:

Uitgelichte Keuze
19,54
Naar shop