We a good story
Quick delivery in the UK

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

About 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.

Show more
  • Language:
  • English
  • ISBN:
  • 9783030063092
  • Binding:
  • Paperback
  • Pages:
  • 280
  • Published:
  • January 24, 2019
  • Edition:
  • 12019
  • Dimensions:
  • 155x235x0 mm.
  • Weight:
  • 456 g.
Delivery: 2-4 weeks
Expected delivery: January 24, 2025
Extended return policy to January 30, 2025
  •  

    Cannot be delivered before Christmas.
    Buy now and print a gift certificate

Description of 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.

User ratings of Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining



Find similar books
The book Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.