Isbn: 9781332262533 - a group theoretic branch and bound algorithm: for the zero-one integer programming (classic reprint) (3 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: New. Print on Demand. This book presents a new algorithm for solving the zero-one integer programming problem, a problem that has been studied by mathematicians for decades. This problem has important applications in a variety of fields such as operations research, logistics, and finance. The author begins by reviewing the history and limitations of existing algorithms for solving this problem. He then introduces a new algorithm that is based on group theory and the concept of shortest paths in networks. The author provides a detailed explanation of the algorithm, along with examples to illustrate how it works. He also discusses the strengths and weaknesses of the algorithm, and he compares it with other existing algorithms. The book concludes with a discussion of the potential applications of the algorithm and its potential for future research. This book is a valuable resource for researchers and practitioners who are interested in solving zero-one integer programming problems. It provides a comprehensive overview of the state-of-the-art in this area, and it offers a new algorithm that has the potential to significantly improve the efficiency of solving these problems. 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. …