Hybrid search for minimal perturbation in dynamic CSPs
From MaRDI portal
Publication:647481
DOI10.1007/S10601-011-9108-5zbMATH Open1233.90176OpenAlexW2140222652MaRDI QIDQ647481FDOQ647481
Alon Grubshtein, Roie Zivan, Amnon Meisels
Publication date: 23 November 2011
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-011-9108-5
Recommendations
- scientific article; zbMATH DE number 1670594
- Robustness and stability in constraint programming under dynamism and uncertainty
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Integer programming for minimal perturbation problems in university course timetabling
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Locating the phase transition in binary constraint satisfaction problems
- An empirical study of phase transitions in binary constraint satisfaction problems
- Message delay and DisCSP search algorithms
- A theoretical evaluation of selected backtracking algorithms.
- Constraint solving in uncertain and dynamic environments: A survey
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- Title not available (Why is that?)
Cited In (9)
- Integer programming for minimal perturbation problems in university course timetabling
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
- A commentary on ``Hybrid search for minimal perturbation in dynamic CSPs
- Dynamic Management of Heuristics for Solving Structured CSPs
- Nature-inspired techniques for dynamic constraint satisfaction problems
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Title not available (Why is that?)
- Quality recovering of university timetables
Uses Software
This page was built for publication: Hybrid search for minimal perturbation in dynamic CSPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647481)
