An optimization algorithm for a penalized knapsack problem
From MaRDI portal
Publication:2466588
DOI10.1016/j.orl.2005.06.001zbMath1133.90383OpenAlexW1988173185MaRDI QIDQ2466588
Alberto Ceselli, Giovanni Righini
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.06.001
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)
Related Items (11)
Integer optimization with penalized fractional values: the knapsack case ⋮ New exact approaches and approximation results for the penalized knapsack problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ The knapsack problem with forfeit sets ⋮ New dynamic programming algorithms for the resource constrained elementary shortest path problem ⋮ A decomposition approach for multidimensional knapsacks with family‐split penalties ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A branch-and-price algorithm for the two-dimensional level strip packing problem
Uses Software
Cites Work
- Unnamed Item
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- Two-dimensional packing problems: a survey
- Models and bounds for two-dimensional level packing problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- An Algorithm for Large Zero-One Knapsack Problems
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Quicksort
This page was built for publication: An optimization algorithm for a penalized knapsack problem
