Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem (Classic Reprint) - Tapa blanda
Sinopsis
Excerpt from Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem
The project was conducted with the Compatible Time Sharing System of Project mac. The problem arises in the context of capital budgeting, but has obvious applications in a variety of other areas. The methods have been employed for solving numerical problems with as many as 105 items, the parameters having been obtained from industrial applications.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem
The project was conducted with the Compatible Time Sharing System of Project mac. The problem arises in the context of capital budgeting, but has obvious applications in a variety of other areas. The methods have been employed for solving numerical problems with as many as 105 items, the parameters having been obtained from industrial applications.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Reseña del editor
Excerpt from Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem
In the knapsack problem, given the desirability of each of a number of items, one seeks to find that subset which satisfies a constraint on total weight. The multi-dimensional variant imposes constraints on addi tional variables of the items; the specification means that an item is either taken or not, i.e., multiples of the same item are not con sidered, except possibly indirectly. Traditionally the l-dimensional knapsack problem is solved by means of dynamic programming. The multi dimensional problem is usually reduced to a one-dimensional one by use of Lagrangian Multipliers which, however, do not generally yield the exact solution to the problem posed. The present paper considers methods for obtaining the exact solution to the problem, and not an approximate one. Additional algorithms are developed which are applied within a dynamic programming framework. Given these, the object is to obtain solutions efficiently, and in attaining this goal heuristic methods are employed. Efficiency of the methods is based upon the use of an inter active computer system in which the heuristics of the problem solver are applied and changed as the character of the solution process evolves. The project was conducted with the Compatible Time Sharing System of Project mac. The problem arises in the context of capital budgeting, but has obvious applications in a variety of other areas.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Method for the Solution of the Multi-Dimensional 0/1...
Imagen del vendedor
Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Print on Demand. 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. 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. Nº de ref. del artículo: 9781333745783_0
Comprar nuevo
EUR 15,61
Gastos de envío gratis
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Method for the Solution of the MultiDimensional 01 Knapsack Problem Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333745783
Comprar nuevo
EUR 21,72
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Method for the Solution of the MultiDimensional 01 Knapsack Problem Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333745783
Comprar nuevo
EUR 20,85
EUR 3,77 shipping
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Method for the Solution of the Multi-Dimensional 0/1 Knapsack Problem (Classic Reprint)
Publicado por
Forgotten Books, 2018
ISBN 10: 1333745788
ISBN 13: 9781333745783
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Nº de ref. del artículo: 27380025/2
Comprar usado
EUR 12,81
EUR 105,00 shipping
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles