Constraint solving in uncertain and dynamic environments: A survey
From MaRDI portal
Publication:816686
DOI10.1007/S10601-005-2239-9zbMATH Open1086.68595OpenAlexW1987789460MaRDI QIDQ816686FDOQ816686
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Temporal constraint networks
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Stochastic constraint programming: A scenario-based approach
- Network-based heuristics for constraint-satisfaction problems
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Title not available (Why is that?)
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Stochastic Boolean satisfiability
- Open constraint programming
- Stochastic dynamic programming with factored representations
- Remote Agent: to boldly go where no AI system has gone before
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- The logic of constraint satisfaction
- Fuzzy \(rr\)DFCSP and planning
- Local search with constraint propagation and conflict-based heuristics
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Branching constraint satisfaction problems and Markov decision problems compared
- Title not available (Why is that?)
- Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1
- Title not available (Why is that?)
- Supporting dispatchability in schedules with consumable resources
Cited In (9)
- Robustness and stability in constraint programming under dynamism and uncertainty
- Handling structured and ambiguous constraints in constraint satisfaction problems
- Hybrid search for minimal perturbation in dynamic CSPs
- Explanation-based large neighborhood search
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
- Title not available (Why is that?)
- Quality recovering of university timetables
- Contractibility for open global constraints
Uses Software
This page was built for publication: Constraint solving in uncertain and dynamic environments: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816686)