Automatic Recording Problem Meinolf Sellmann Brown University, Department of...  Home/Search
Context
Related
| brown.edu/people/sello/PAPER/cp05.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brown.edu/resea...hybrid_methods (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. Obviously, as an augmentation of the knapsack constraint, achieving generalized arc-consistency for the ARC is NP-hard. Consequently, we will develop a filtering algorithm for the constraint that does not guarantee backtrack-free search for the ARP, but that achieves at least approximated consistency with respect to bounds of arbitrary accuracy (Update)
Active bibliography (related documents): More All
1.7: Approximated Consistency for the - Automatic Recording Problem (2005) (Correct)
0.5: Approximated Consistency for - Knapsack Constraints Meinolf (Correct)
0.5: The Practice of Approximated Consistency for Knapsack.. - Meinolf Sellmann Cornell (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ problem-approximated,
author = "Automatic Recording Problem",
title = "Approximated Consistency for the",
url = "citeseer.ist.psu.edu/753483.html" }
Citations (may not include all citations):185 A Sufficient Condition for Backtrack-Free Search (context) - Freuder - 1982
96 Fast Approximation Algorithms for the Knapsack and Sum of Su.. (context) - Ibarra, Kim - 1975
7 Cost-Based Filtering for the Constrained Knapsack Problem (context) - Fahle, Sellmann - 2002
6 Principles and Practice of Constraint Programming (context) - Focacci, Lodi et al. - 1999
6 Constraint Programming Based Lagrangian Relaxation for the A.. (context) - Sellmann, Fahle - 2003
4 Approximated Consistency for Knapsack Constraints (context) - Sellmann - 2003
4 Integration of Mathematical Programming and Constraint Progr.. (context) - Milano - 2000
4 A Dynamic Programming Approach for Consistency and Propagati.. - Trick - 2001
2 The Practice of Approximated Consistency for Knapsack Constr.. - Sellmann - 2004
Documents on the same site (http://www.cs.brown.edu/research/projects/opti-hybrid_methods.html): More
The Practice of Approximated Consistency for Knapsack.. - Meinolf Sellmann Cornell (2004) (Correct)
Shorter Path Constraints for the - Resource Constrained Shortest (Correct)
Cost-Based Filtering for Shorter Path Constraints - Meinolf Sellmann Cornell (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC