An optimization algorithm for a penalized knapsack problem

DOI10.1016/j.orl.2005.06.001zbMath1133.90383MaRDI 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

zbMATH Keywords

combinatorial optimization; knapsack problem

Mathematics Subject Classification ID

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90C27: Combinatorial optimization

Related Items

A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, A branch-and-price algorithm for the two-dimensional level strip packing problem, New dynamic programming algorithms for the resource constrained elementary shortest path problem

Uses Software

• Knapsack
• Quicksort

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