Branch and Bound Methods for Combinatorial Problems
John D C Little
Gebundenes Buch

Branch and Bound Methods for Combinatorial Problems

Versandfertig in über 4 Wochen
29,99 €
inkl. MwSt.
PAYBACK Punkte
15 °P sammeln!
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. 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 ...