Bookbot

Branch and Bound Methods for Combinatorial Problems

Paramètres

Pages
56pages
Temps de lecture
2heures

En savoir plus sur le livre

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.

Achat du livre

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

Langue
Année de publication
2023
product-detail.submit-box.info.binding
(souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.

Modes de paiement

Personne n'a encore évalué .Évaluer