Meinolf Sellmann  Home/Search
Context
Related
| icparc.icparc.ic.a...int_propagation.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: icparc.icparc.ic....papers_byyear (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For NP-hard constraint satisfaction problems the existence of a feasible solution cannot be decided e ciently. Applying a tree search often results in the exploration of parts of the search space that do not contain feasible solutions at all. Redundant constraints can help to detect inconsistencies of partial assignments higher up in the search tree. Using the social golfer problem as an example we show how redundant constraints that are potentially NP-hard themselves can be propagated... (Update)
Similar documents (at the sentence level):
47.7%: Proceedings CPAIOR'02 - Heuristic Constraint Propagation (Correct)
6.6%: Heuristic Constraint Propagation - Meinolf Sellmann And (Correct)
Active bibliography (related documents): More All
0.2: An Arc-Consistency Algorithm for the - Minimum Weight All (Correct)
0.2: Groups and Constraints: Symmetry Breaking during Search - Gent, Harvey, Kelsey (2002) (Correct)
0.2: Partial Symmetry Breaking - McDonald, Smith (2002) (Correct)
Similar documents based on text: More All
1.0: Symmetry Breaking and the Social Golfer Problem - Harvey (2001) (Correct)
1.0: Solving the Kirkman's Schoolgirl Problem in a Few Seconds - Barnier, Brisset (2002) (Correct)
0.7: Supersymmetric Modeling for Local Search - Prestwich (Correct)
BibTeX entry: (Update)
@misc{ sellmann-heuristic,
author = "Meinolf Sellmann",
title = "Heuristic Constraint Propagation Using Local Search for Incomplete Pruning
and Domain Filtering of Redundant Constraints for the Social Golfer Problem",
url = "citeseer.ist.psu.edu/sellmann02heuristic.html" }
Citations (may not include all citations):125 Greedy randomized adaptive search procedures - Feo, Resende - 1995
112 A computational study of the job-shop scheduling problem (context) - Applegate, Cook - 1991
38 Symmetry Breaking During Search in Constraint Programming - Gent, Smith - 1999
38 Ten Challenges in Propositional Reasoning and Search - Selman, Kautz et al. - 1997
28 Reference manual and user manual (context) - Solver - 2000
26 Global Cut Framework for Removing Symmetries (context) - Focacci, Milano - 2001
24 Reducing Symmetry in a Combinatorial Design Problem - Smith - 2001
24 Symmetry Breaking - Fahle, Schamberger et al. - 2001
22 A hybrid search architecture applied to hard random 3-SAT an.. - Prestwich - 2000
6 Unique Symmetry Breaking in CSPs Using Group Theory - McDonald - 2001
4 Heuristics for large constrained routing problems (context) - Caseau, Laburthe - 1999
3 Kluwer Academic Publishers (context) - Focacci, Laburthe et al.
2 A view of local search in constrained programming (context) - Pesant, Gendreau - 1996
Documents on the same site (http://www-icparc.icparc.ic.ac.uk/papers_byyear.html): More
Ongoing Research in CHIC-2: Decision making under uncertainty - Gervet (Correct)
Large Combinatorial Optimization Problems: a Methodology for.. - Gervet (1998) (Correct)
Mode Checking in HAL - Banda, Stuckey, Harvey, Marriott (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