Name
Abstract | ||
|---|---|---|
In this paper, we investigate the parametric knapsack problem, in which the item profits are affine functions depending on a real-valued parameter. The aim is to provide a solution for all values of the parameter. It is well-known that any exact algorithm for the problem may need to output an exponential number of knapsack solutions. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ipl.2017.06.006 | Information Processing Letters |
Keywords | DocType | Volume |
Knapsack problems,Parametric optimization,Approximation algorithms | Journal | 126 |
ISSN | Citations | PageRank |
0020-0190 | 3 | 0.40 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Holzhauser | 1 | 13 | 3.34 |
| Sven O. Krumke | 2 | 308 | 36.62 |