Constraint solving in uncertain and dynamic environments: A survey
From MaRDI portal
Publication:816686
DOI10.1007/s10601-005-2239-9zbMath1086.68595OpenAlexW1987789460MaRDI QIDQ816686
Gérard Verfaillie, Narendra Jussien
Publication date: 23 February 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-2239-9
Related Items
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions, Contractibility for open global constraints, Hybrid search for minimal perturbation in dynamic CSPs, Quality recovering of university timetables, Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems, Explanation-based large neighborhood search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy \(rr\)DFCSP and planning
- Stochastic constraint programming: A scenario-based approach
- Supporting dispatchability in schedules with consumable resources
- Network-based heuristics for constraint-satisfaction problems
- Temporal constraint networks
- The logic of constraint satisfaction
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Remote Agent: to boldly go where no AI system has gone before
- Constraint retraction in CLP(FD): Formal framework and performance results
- Ultraviolet: A constraint satisfaction algorithm for interactive graphics
- Solving mixed and conditional constraint satisfaction problems
- Stochastic dynamic programming with factored representations
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Local search with constraint propagation and conflict-based heuristics
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Branching constraint satisfaction problems and Markov decision problems compared
- Open constraint programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14.1]
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Stochastic Boolean satisfiability
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
