Trending Bestseller

Branch-and-bound Strategies for Dynamic Programming

No reviews yet Write a Review
Hardback
18 July 2023
$51.20
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:

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.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it.

This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

You Can Find This Title In

    Product Details
    ISBN-13
    9781019950494
    Author
    Thomas L Morin
    Publisher
    Legare Street Press
    Published
    18 July 2023
    Format
    Hardback

    This product hasn't received any reviews yet. Be the first to review this product!

    $51.20
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Branch-and-bound Strategies for Dynamic Programming

    $51.20

    Description

    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.

    This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it.

    This work is in the "public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

    Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

    You Can Find This Title In

      This Title Is Categorised As