Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining / Najlacnejšie knihy
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Code: 19355425

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

by Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional d ... more

102.84

RRP: 111.46 €

You save 8.61 €


In stock at our supplier
Shipping in 10 - 13 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

You get 249 loyalty points

Book synopsis

Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object from a given set of objects. This book develops extensions of dynamic programming, enabling us to (i) describe the set of objects under consideration; (ii) perform a multi-stage optimization of objects relative to different criteria; (iii) count the number of optimal objects; (iv) find the set of Pareto optimal points for bi-criteria optimization problems; and (v) to study relationships between two criteria. It considers various applications, including optimization of decision trees and decision rule systems as algorithms for problem solving, as ways for knowledge representation, and as classifiers; optimization of element partition trees for rectangular meshes, which are used in finite element methods for solving PDEs; and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths. The results presented are useful for researchers in combinatorial optimization, data mining, knowledge discovery, machine learning, and finite element methods, especially those working in rough set theory, test theory, logical analysis of data, and PDE solvers. This book can be used as the basis for graduate courses.

Book details

Book category Books in English Computing & information technology Databases Data mining

102.84

Trending among others



Collection points Bratislava a 12770 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: