• 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 Methods for Combinatorial Problems

Branch and Bound Methods for Combinatorial Problems

Paperback

Business GeneralCalculusGeneral World History

ISBN10: 1021500739
ISBN13: 9781021500731
Publisher: Legare Street Pr
Published: Jul 18 2023
Pages: 56
Weight: 0.20
Height: 0.12 Width: 6.14 Depth: 9.21
Language: English

Combinatorial problems arise in a wide variety of fields, from computer science to operations research to engineering. This book provides an in-depth introduction to the branch and bound method, a powerful algorithmic technique for solving combinatorial optimization problems. With clear explanations, detailed examples, and practical advice, John D. C. Little's work is an essential resource for anyone seeking to understand this important area of research.

1 different editions

Also available

Also from

Little, John D. C.

Also in

General World History