Pardalos Handbook of Combinatorial Optimization

Handbook of Combinatorial Optimization

von

Preis unbekannt

Buch in deiner Nähe kaufen


...oder deine aktuelle Postleitzahl eingeben:
oder

Beschreibung



The third edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board.

The Handbook of Combinatorial Optimization, third edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as non-specialists will find the material stimulating and useful.


This third edition features 20% new content, additional chapters as well as updated content Subject spans much of applied mathematics, computer science and operations research Overlaps with fields such as computation complexity, computational biology, VLSI design, and communications networks

Autor*in

Panos M. Pardalos

Themen in »Handbook of Combinatorial Optimization«

Combinatorial Optimization combinatorics dual integrality geometric shortest path coloring of graphs fuzzy combinatorial optimization

Stimmen zu »Handbook of Combinatorial Optimization«

Details

ISBN: 9781071650165
Verlag: Springer US
Erscheinung: 16.12.2027

Link teilen


Über buchnah.de | Die Buchhandlungen | Die Verlage | Impressum & Kontakt | Datenschutz | Presse


Auf dieser Seite kannst Du Buchhandlungen in der Nähe finden