Sensitivity analysis for knapsack problems: a negative result
نویسندگان
چکیده
منابع مشابه
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...
متن کامل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...
متن کامل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 ...
متن کاملKnapsack Problems for Wreath Products
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product. On the other hand, the class of knapsack-semilinear groups, where solutions sets of knapsack equations are effectively semilinear, is closed under...
متن کاملKnapsack problems: A book review
We review the recent book authored by Hans Kellerer, Ulrich Pferschy, and David Pisinger, Knapsack Problems, Springer, Berlin Heidelberg New York 2004, ISBN 3-540-40286-1, price: $129.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00080-2