Approaches to find a near-minimal change solution for Dynamic CSPs

Yong Ping Ran, Nico Roos, H.J. van den Herik

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Original languageEnglish
Title of host publicationFourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems
Pages373-387
Number of pages15
Publication statusPublished - 2002

Cite this

Ran, Y. P., Roos, N., & Herik, H. J. V. D. (2002). Approaches to find a near-minimal change solution for Dynamic CSPs. In Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems (pp. 373-387)