9781334018299 - Branch and Bound Methods for Combinatorial Problems (Classic Reprint) de Little, John D. C. (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: New. Print on Demand. This book brings to light a novel approach to optimization problems, particularly in combinatorial settings. The central idea revolves around a technique known as branch and bound methods, a framework offering general guidelines for solving complex problems rather than explicitly detailing a solution. The author explores the technique's efficacy in solving diverse problems such as sequencing jobs, managing traffic lights, and scheduling tasks in flow shops. Through detailed explanations and practical examples, the book delves into how the method operates, providing insights into its computational efficiency and the theoretical underpinnings of its success. Overall, this book offers a valuable resource for professionals seeking to understand and apply branch and bound methods to their own optimization challenges. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.