An optimization algorithm for a penalized knapsack problem
Authors:
- Alberto CeselliACAlberto Ceselli
- Giovanni RighiniGRGiovanni Righini
- 1 July 2006
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 34 (4) , 394-404
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Models and Bounds for Two-Dimensional Level Packing ProblemsJournal of Combinatorial Optimization, 2004
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing ProblemOperations Research, 2003
- Two-dimensional packing problems: A surveyEuropean Journal of Operational Research, 2002
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack ProblemManagement Science, 1999
- A Minimal Algorithm for the 0-1 Knapsack ProblemOperations Research, 1997
- An Algorithm for Large Zero-One Knapsack ProblemsOperations Research, 1980
- QuicksortThe Computer Journal, 1962