On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency.
Meinolf SellmannPublished in: CP (2009)
Keyphrases
- upper bound
- global constraints
- lower and upper bounds
- path consistency
- consistency checking
- constraint networks
- global consistency
- lower bound
- upper and lower bounds
- constrained optimization
- constraint solving
- consistency constraints
- constraint programming
- constraint satisfaction
- worst case
- dynamic programming
- constraint problems
- genetic algorithm
- disjunctive constraints
- geometric constraints
- np hard
- learning algorithm