The practice of approximated consistency for knapsack constraints

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 179-184

  Sellmann, Meinolf ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

AUTOMATIC RECORDING PROBLEM; CONSISTENCY; FILTERING ALGORITHM; KNAPSACK CONSTRAINTS;

CONSTRAINT THEORY;

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

References (11)

1. K. Aardal, R.E. Bixby, C.A.J. Hurkens, A.K. Lenstra, J.W. Smeltink. Market Split and Basis Reduction: Towards a Solution of the Comuéjols- Dawande Instances. IPCO, Springer LNCS 1610:1-16, 1999.
2. ARP: A Benchmark Set for the Automatic Recording Problem, maintained by M. Sellmann, http://www.cs.cornell.edu/~sello/-arp_benchmark.tar.gz
3. G. Cornuéjols, M. Dawande. A Class of Hard Small 0-1 Programs. IPCO, Springer LNCS 1412:284-293, 1998.
4. T. Fahle, M. Sellmann. Cost-Based Filtering for the Constrained Knapsack Problem. AOR, 115:73-93, 2002.
5. F. Focacci, A. Lodi, M. Milano. Cost-Based Domain Filtering. CP, Springer LNCS 1713:189-203, 1999.
6. E.L. Lawler. Fast Approximation Algorithm for Knapsack Problems. FOCS, pp. 206-213, 1977.
7. M. Sellmann. Approximated Consistency for Knapsack Constraints. CP, Springer LNCS 2833: 679-693, 2003.
8. M. Sellmann and T. Fahle. Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. AOR, 118:17-33, 2003.
9. TIVO. TV your way. TIVO, Inc., http://-www.tivo.com/home.asp.
10. M. Trick. A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. CP-AI-OR'01, pp. 113-124, 2001.
11. H.P. Williams. Model Building in Mathematical Programming. Wiley, 1978.