Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem (Classic Reprint) - Softcover

H. Martin Weingartner

 
9781333745783: Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem (Classic Reprint)

Synopsis

This book introduces a novel computational method for solving multi-dimensional multi-variate knapsack problems. The knapsack problem is a classic problem in operations research, and it has applications in a wide range of problems in business, economics, and engineering. The author develops a new dynamic programming algorithm with a number of features that make it more efficient than existing methods, such as the use of a look-ahead strategy, a lower bound elimination method, and an upper bound method. These features help the algorithm to reduce the number of branches that must be considered, resulting in a significant reduction in computation time. The author also developed a user-friendly computer program based on this new algorithm, and he discusses using the program to efficiently solve. The book offers a comprehensive description of the algorithm with detailed examples and case studies, illustrating how it can be used to solve complex real-world problems. Aimed at researchers and advanced students in operations research, industrial engineering, and business administration, this book is a valuable resource on the latest techniques for solving multi-dimensional multi-variate knapsack problems.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title