Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Lisp and Symbolic Computation
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Weak-commitment search for solving constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A genetic algorithm for the generalised assignment problem
Computers and Operations Research
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Graph coloring conditions for the existence of solutions to the timetable problem
Communications of the ACM
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Radio Link Frequency Assignment
Constraints
Earth Observation Satellite Management
Constraints
A Survey of Automated Timetabling
Artificial Intelligence Review
A Constraint-Based High School Scheduling System
IEEE Expert: Intelligent Systems and Their Applications
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Simulated Annealing with Asymptotic Convergence for Nonlinear Constrained Global Optimization
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Partition-Based Lower Bound for Max-CSP
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Directed Arc Consistency Preprocessing
Constraint Processing, Selected Papers
Heuristic Methods for Over-Constrained Constraint Satisfaction Problems
Over-Constrained Systems
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Enhancements of branch and bound methods for the maximal constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Tabu search techniques for large high-school timetabling problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics
Extended constraint handling for CP-networks
Intelligent information processing II
IBM Journal of Research and Development - Business optimization
Modified branch and bound algorithm
EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Understanding the schema matching problem
ACS'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Applied Computer Science - Volume 7
Automated reverse engineering of hard-coded GUI layouts
AUIC '08 Proceedings of the ninth conference on Australasian user interface - Volume 76
Constraint satisfaction problem using modified branch and bound algorithm
WSEAS Transactions on Computers
Constraint Relaxation Approach for Over-Constrained Agent Interaction
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Solving over-constrained problems with SAT technology
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We summarize existing approaches to model and solve overconstrained problems. These problems are usually formulated as combinatorial optimization problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization. Regarding solving methods, both systematic and local search approaches are considered. Finally we review a number of case studies on overconstrained problems taken from the specialized literature.