Paradigms of Combinatorial Optimization Problems and New Approaches
-
Form:Einzelkauf Download
-
Sprache:Englisch
-
eBook Format:ePUB
- PDF Fr. 257.00
- ePUB Fr. 273.00 ausgewählt
-
Auflage:2. Auflage
- 2. Auflage Fr. 273.00 ausgewählt
- 1. Auflage Fr. 257.00
Fr. 273.00
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
ePUB
Kopierschutz
Ja
Family Sharing
Nein
Text-to-Speech
Ja
Erscheinungsdatum
08.08.2014
Herausgeber
Vangelis Th. PaschosVerlag
WileySeitenzahl
720 (Printausgabe)
Dateigröße
23748 KB
Auflage
2. Auflage
Sprache
Englisch
EAN
9781119015192
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 aim 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,
presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods
for solving hard combinatorial optimization problems, that are
Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals
from mathematical programming based methods that are in the heart
of Operations Research since the origins of this field.
area, lying in the interface of three major scientific domains:
mathematics, theoretical computer science and management. The
three volumes of the Combinatorial Optimization series aim 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,
presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods
for solving hard combinatorial optimization problems, that are
Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting 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.