Average Saving Effects in Enumerative Methods for Solving Knapsack Problems
نویسندگان
چکیده
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملSolving knapsack problems on GPU
A parallel implementation via CUDA of the dynamic programming method for the knapsack problem on NVIDIA GPU is presented. A GTX 260 card with 192 cores (1.4 GHz) is used for computational tests and processing times obtained with the parallel code are compared to the sequential one on a CPU with an Intel Xeon 3.0 GHz. The results show a speedup factor of 26 for large size problems. Furthermore, ...
متن کاملModular Approach for Solving Nonlinear Knapsack Problems
This paper develops an algorithm based on the Modular Approach to solve singly constrained separable discrete optimization problems (Nonlinear Knapsack Problems). The Modular Approach uses fathoming and integration techniques repeatedly. The fathoming reduces the decision space of variables. The integration reduces the number of variables in the problem by combining several variables into one v...
متن کاملA toolbox for solving knapsack problems
The program is written in Java, hence it should in principle run in any browser having Java enabled. The present version has mainly been tested using the Windows browser Explorer, hence if you have problems, please use the Windows computers in Multimedie Lab, 1st floor, south. You may also download all the relevant files index.html, AppletTest.jar, data.1, data.2, data.3 to your home directory ...
متن کاملSolving knapsack and related problems
Knapsack problems and variants thereof arise in several different fields from operations research to cryptography to really, really serious problems for hard−core puzzle enthusiasts. We discuss some of these and show ways in which one might formulate and solve them using Mathematica.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1994
ISSN: 0885-064X
DOI: 10.1006/jcom.1994.1005