Hybrid search for minimal perturbation in dynamic CSPs

DOI10.1007/S10601-011-9108-5MaRDI QIDQ647481zbMATH OpenOpenAlexFDO

Authors Roie Zivan, Alon Grubshtein, 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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 1670594 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• A theoretical evaluation of selected backtracking algorithms.
• An empirical study of phase transitions in binary constraint satisfaction problems
• Constraint solving in uncertain and dynamic environments: A survey
• Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
• Locating the phase transition in binary constraint satisfaction problems
• Message delay and DisCSP search algorithms
• Probe backtrack search for minimal perturbation in dynamic scheduling

Cited in

(9)

• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• A commentary on ``Hybrid search for minimal perturbation in dynamic CSPs
• Nature-inspired techniques for dynamic constraint satisfaction problems
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Dynamic Management of Heuristics for Solving Structured CSPs
• Integer programming for minimal perturbation problems in university course timetabling
• Quality recovering of university timetables
• Probe backtrack search for minimal perturbation in dynamic scheduling
• scientific article; zbMATH DE number 1670594 (Why is no real title available?)

Describes a project that uses

Uses Software

• CSPLib

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)