Hybrid search for minimal perturbation in dynamic CSPs

DOI10.1007/s10601-011-9108-5zbMath1233.90176OpenAlexW2140222652MaRDI QIDQ647481

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

Mathematics Subject Classification ID

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

Related Items

A commentary on ``Hybrid search for minimal perturbation in dynamic CSPs ⋮ Nature-inspired techniques for dynamic constraint satisfaction problems ⋮ Integer programming for minimal perturbation problems in university course timetabling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Quality recovering of university timetables

Uses Software

• CSPLib

Cites Work

• Constraint solving in uncertain and dynamic environments: A survey
• Message delay and DisCSP search algorithms
• A theoretical evaluation of selected backtracking algorithms.
• Probe backtrack search for minimal perturbation in dynamic scheduling
• Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
• An empirical study of phase transitions in binary constraint satisfaction problems
• Locating the phase transition in binary constraint satisfaction problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Hybrid search for minimal perturbation in dynamic CSPs