Bookbot

Branch and Bound Methods for Combinatorial Problems

Parameter

Seitenzahl
56 Seiten
Lesezeit
2 Stunden

Mehr zum Buch

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.

Buchkauf

Branch and Bound Methods for Combinatorial Problems, John D. C. Little

Sprache
Erscheinungsdatum
2023
product-detail.submit-box.info.binding
(Paperback)
Wir benachrichtigen dich per E-Mail.

Lieferung

  •  

Zahlungsmethoden

Keiner hat bisher bewertet.Abgeben