Approximated Consistency for Knapsack Constraints

Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorithm for Knapsack constraints was published that is based on some previously developed approximation algorithms for the Knapsack problem. In this paper, we provide an empirical evaluation of approximated consistency for Knapsack constraints by applying it to the Market Split Problem and the Automatic Recording Problem.

• Type: Conference
• Year: 2003
• Where: CP
• Authors: Meinolf Sellmann
• Keywords: CP 2003, Knapsack Constraints, Knapsack Problem, Programming Languages, Real-life Problem Formulations