Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2004 | AAAI | knapsack problem,knapsack constraint,market split problem,approximated consistency,discrete optimization,real-life problem formulation,approximation algorithm,key modeling structure,automatic recording problem,empirical evaluation,constraint programming |
Field | DocType | ISBN |
Approximation algorithm,Mathematical optimization,Change-making problem,Discrete optimization,Computer science,Generalized assignment problem,Continuous knapsack problem,Cutting stock problem,Knapsack problem,Polynomial-time approximation scheme | Conference | 0-262-51183-5 |
Citations | PageRank | References |
8 | 0.66 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meinolf Sellmann | 1 | 728 | 48.77 |