Approximating single- and multi-objective nonlinear sum and product knapsack problems

Exact algorithms for the 0–1 Time-Bomb Knapsack Problem

(2022) Michele Monaci et al.   COMPUTERS & OPERATIONS RESEARCH

Approximating the product knapsack problem

(2021) Ulrich Pferschy et al.   Optimization Letters

Relaxations and heuristics for the multiple non-linear separable knapsack problem

(2018) Claudia D’Ambrosio et al.   COMPUTERS & OPERATIONS RESEARCH

On the Product Knapsack Problem

(2018) Claudia D’Ambrosio et al.   Optimization Letters

Approximation schemes for r-weighted Minimization Knapsack problems

(2018) Khaled Elbassioni et al.   ANNALS OF OPERATIONS RESEARCH

Bi-criteria path problem with minimum length and maximum survival probability

(2018) Nir Halman et al.   OR SPECTRUM

Approximation of the Quadratic Knapsack Problem

(2016) Richard Taylor   OPERATIONS RESEARCH LETTERS

Heuristic algorithms for the general nonlinear separable knapsack problem

(2010) Claudia D’Ambrosio et al.   COMPUTERS & OPERATIONS RESEARCH

Min–max and min–max regret versions of combinatorial optimization problems: A survey

(2008) Hassene Aissi et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Nonconvex piecewise linear knapsack problems

(2007) S. Kameshwaran et al.   EUROPEAN JOURNAL OF OPERATIONAL RESEARCH