Access the full text.
Sign up today, get DeepDyve free for 14 days.
David McAllester, B. Selman, Henry Kautz (1997)
Evidence for Invariants in Local Search
Molly Wilson, A. Borning (1994)
Hierarchical Constraint Logic ProgrammingJ. Log. Program., 16
R. Mangoubi, Dennis Mathaisel (1985)
Optimizing Gate Assignments at Airport TerminalsTransp. Sci., 19
M. Henz (2001)
Scheduling a Major College Basketball Conference - RevisitedOper. Res., 49
J. Walser (2000)
Integer Optimization by Local Search, 1637
Hana Rudová (1999)
Over-Constrained Systems
G. Nemhauser, M. Trick (1998)
Scheduling A Major College Basketball ConferenceOper. Res., 46
Stefano Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie (1995)
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
J. Walser (1998)
Domain independent local search for linear integer optimization
A. Borning, B. Freeman-Benson, Molly Wilson (1987)
Constraint hierarchiesLISP and Symbolic Computation, 5
J. Walser (1997)
Solving Linear Pseudo-Boolean Constraint Problems with Local Search
Eugene Freuder, R. Wallace (1989)
Partial Constraint SatisfactionArtif. Intell., 58
J. Walser (1999)
Integer Optimization by Local Search: A Domain-Independent Approach
B. Selman, Henry Kautz, Bram Cohen (1994)
Noise Strategies for Improving Local Search
Yu Cheng (1998)
A rule-based reactive model for the simulation of aircraft on airport gatesKnowl. Based Syst., 10
H. Bhargava, R. Krishnan, P. Harker (1998)
Scheduling a Major College Basketball ConferenceOperations Research, 46
Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 5, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.