Amazon cover image
Image from Amazon.com

Extensions of dynamic programming for combinatorial optimization and data mining / Hassan AbouEisha; Talha Amin; Igor Chikalov; Shahid Hussain; Mikhail Moshkov

By: Material type: TextTextSeries: Intelligent systems reference library ; 146Publication details: Cham, Switzerland : Springer, c2019.Description: xvi, 280 p. : ill. ; 22 cmISBN:
  • 9783319918389
Subject(s): DDC classification:
  • 005.74 AB EX
Online resources: Summary: 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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Notes Date due Barcode
REGULAR University of Wollongong in Dubai Main Collection 005.74 AB EX (Browse shelf(Opens below)) Available Nov2018 T0060952

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.

There are no comments on this title.

to post a comment.