Concepts of Combinatorial Optimization

Concepts of Combinatorial Optimization

Vangelis Th. Paschos, (ed.)
この本はいかがでしたか?
ファイルの質はいかがですか?
質を評価するには、本をダウンロードしてください。
ダウンロードしたファイルの質はいかがでしたか?
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.
年:
2010
版:
1
出版社:
Wiley-ISTE
言語:
english
ページ:
381
ISBN 10:
1848211473
ISBN 13:
9781848211476
シリーズ:
ISTE
ファイル:
PDF, 2.28 MB
IPFS:
CID , CID Blake2b
english, 2010
オンラインで読む
への変換進行中。
への変換が失敗しました。

主要なフレーズ