Approximated consistency for knapsack constraints (Q5897222)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5676680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximated consistency for knapsack constraints |
scientific article; zbMATH DE number 5676680 |
Statements
Principles and Practice of Constraint Programming – CP 2003 (English)
0 references
2 March 2010
0 references
global constraints
0 references
optimization constraints
0 references
cost-based filtering
0 references
relaxed consistency
0 references
approximation algorithms
0 references
0.8113255500793457
0 references
0.802868127822876
0 references
0.7730927467346191
0 references
0.7704474329948425
0 references
