• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Branch-and-bound Strategies for Dynamic Programming

Branch-and-bound Strategies for Dynamic Programming

Paperback

Business GeneralGeneral World History

ISBN10: 1021501271
ISBN13: 9781021501271
Publisher: Legare Street Pr
Published: Jul 18 2023
Pages: 60
Weight: 0.21
Height: 0.12 Width: 6.14 Depth: 9.21
Language: English

Dynamic programming is a powerful tool for solving a wide range of optimization problems, from scheduling to resource allocation to network design. This book presents an innovative approach to solving these problems using the branch and bound method, a technique that has typically been used for solving combinatorial problems. With clear explanations, insightful examples, and practical advice, Roy E. Marsten and Thomas L. Morin show how to apply this powerful approach to a variety of dynamic programming problems.

1 different editions

Also available

Also from

Morin, Thomas L.

Also in

Business General