28,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 2-4 Wochen
  • Broschiertes Buch

This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.

Produktbeschreibung
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.