Concepts of Combinatorial Optimization

Concepts of Combinatorial Optimization

Vangelis Th. Paschos, (ed.)
Sukakah anda buku ini?
Bagaimana kualiti fail ini?
Muat turun buku untuk menilai kualitinya
Bagaimana kualiti fail yang dimuat turun?
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.
Tahun:
2010
Edisi:
1
Penerbit:
Wiley-ISTE
Bahasa:
english
Halaman:
381
ISBN 10:
1848211473
ISBN 13:
9781848211476
Nama siri:
ISTE
Fail:
PDF, 2.28 MB
IPFS:
CID , CID Blake2b
english, 2010
Baca dalam Talian
Penukaran menjadi sedang dijalankan
Penukaran menjadi gagal

Istilah utama