Siirry suoraan sisältöön
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Tallenna

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths.

Painos
Softcover Reprint of the Original 1st 2019 ed.
ISBN
9783030063092
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
25.1.2019
Sivumäärä
280