Propagating knapsack constraints in sublinear time

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 231-236

  Katriel, Irit ^a   Sellmann, Meinolf ^a   Upfal, Eli ^a   Van Hentenryck, Pascal ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST-BASED FILTERING ALGORITHM; KNAPSACK CONSTRAINTS; SUBLINEAR TIME; WORST-CASE COMPLEXITY;

CONSTRAINT THEORY; COST ACCOUNTING; HEURISTIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 36348991434     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Aldous, D., and Diaconis, P. 1999. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. of the Amer. Math. Society 36(4):413-432.
2. Brodal, G. S. 2005. Finger search trees. In Handbook of Data Structures and Applications. CRC Press.
3. Dantzig, G. 1957. Discrete variable extrémùm problems. Operations Research 5:226-277.
4. Fahle, T., and Sellmann, M. 2002. Cost-based filtering for the constrained knapsack problem. AOR 115:73-93.
5. Katriel, I., and Van Hentenryck, P. 2006. Randomized filtering algorithms. Technical Report CS-06-09, Brown U.
6. Pisinger, D. 2005. Where are the hard knapsack problems? Computers and Operations Research 32:2271-2282.
7. Sellmann, M. 2003. Approximated consistency for knapsack constraints. In CP'03.