Gå direkte til innholdet
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
Spar

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.

Opplag
Softcover Reprint of the Original 1st 2019 ed.
ISBN
9783030063092
Språk
Engelsk
Vekt
310 gram
Utgivelsesdato
25.1.2019
Antall sider
280