Special issue on knapsack problems and applications

摘要

Knapsack problems are encountered in numerous industrial sectors such as transportation, logistics, cutting and packing, telecommunication, reliability, advertisement, investment, budget allocation, and production management. They appear either as standalone problems or as sub-problems of more complex programming models. For example, they arise as a result of continuous, Lagrangean, and surrogate relaxations of scheduling and cutting problems. Their efficient resolution provides in most instances tight bounds for enumerative algorithms of branch and bound type.