Concepts of Combinatorial Optimization, Volume 1
-
Form:Einzelkauf Download
-
Sprache:Englisch
-
eBook Format:PDF
- PDF 160,99 € ausgewählt
- ePUB 149,99 €
-
Verlag:John Wiley & Sons Inc
160,99 €
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Ja
Family Sharing
Nein
Text-to-Speech
Nein
Erscheinungsdatum
27.12.2012
Herausgeber
Vangelis Th. PaschosVerlag
John Wiley & Sons IncSeitenzahl
368 (Printausgabe)
Dateigröße
2241 KB
Auflage
1. Auflage
Sprache
Englisch
EAN
9781118600191
Combinatorial optimization is a multidisciplinary scientific area,
lying in the interface of three major scientific domains:
mathematics, theoretical computer science and management.
The three volumes of the Combinatorial Optimization
series aims to cover a wide range of topics in this area. These
topics also deal with fundamental notions and approaches as with
several classical applications of combinatorial optimization.
Concepts of Combinatorial Optimization, is divided into
three parts:
* On the complexity of combinatorial optimization problems, that
presents basics about worst-case and randomized complexity;
* Classical solution methods, that presents the two most-known
methods for solving hard combinatorial optimization problems, that
are Branch-and-Bound and Dynamic Programming;
* Elements from mathematical programming, that presents
fundamentals from mathematical programming based methods that are
in the heart of Operations Research since the origins of this
field.
lying in the interface of three major scientific domains:
mathematics, theoretical computer science and management.
The three volumes of the Combinatorial Optimization
series aims to cover a wide range of topics in this area. These
topics also deal with fundamental notions and approaches as with
several classical applications of combinatorial optimization.
Concepts of Combinatorial Optimization, is divided into
three parts:
* On the complexity of combinatorial optimization problems, that
presents basics about worst-case and randomized complexity;
* Classical solution methods, that presents the two most-known
methods for solving hard combinatorial optimization problems, that
are Branch-and-Bound and Dynamic Programming;
* Elements from mathematical programming, that presents
fundamentals from mathematical programming based methods that are
in the heart of Operations Research since the origins of this
field.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.
Kurze Frage zu unserer Seite
Vielen Dank für dein Feedback
Wir nutzen dein Feedback, um unsere Produktseiten zu verbessern. Bitte habe Verständnis, dass wir dir keine Rückmeldung geben können. Falls du Kontakt mit uns aufnehmen möchtest, kannst du dich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice