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

Y.P. Ran, N. Roos, H.J. van den Herik

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

Original languageEnglish
Title of host publicationFourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, Le Croisic, France, March 23-27, 2002
Subtitle of host publicationProceedings
Place of Publication[S.l.]
Publisher[s.n.]
Pages373-387
Number of pages15
Volume4
Publication statusPublished - 2002
Externally publishedYes

Publication series

Name
Volume4

Cite this

Ran, Y. P., Roos, N., & van den Herik, H. J. (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, Le Croisic, France, March 23-27, 2002: Proceedings (Vol. 4, pp. 373-387). [S.l.]: [s.n.].
Ran, Y.P. ; Roos, N. ; van den Herik, H.J. / Approaches to find a near-minimal change solution for dynamic CSPs. Fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, Le Croisic, France, March 23-27, 2002: Proceedings. Vol. 4 [S.l.] : [s.n.], 2002. pp. 373-387
@inproceedings{c7f720af537d446d9b346b41f72ec5da,
title = "Approaches to find a near-minimal change solution for dynamic CSPs",
author = "Y.P. Ran and N. Roos and {van den Herik}, H.J.",
note = "Pagination: 15",
year = "2002",
language = "English",
volume = "4",
publisher = "[s.n.]",
pages = "373--387",
booktitle = "Fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, Le Croisic, France, March 23-27, 2002",

}

Ran, YP, Roos, N & van den Herik, HJ 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, Le Croisic, France, March 23-27, 2002: Proceedings. vol. 4, [s.n.], [S.l.], pp. 373-387.

Approaches to find a near-minimal change solution for dynamic CSPs. / Ran, Y.P.; Roos, N.; van den Herik, H.J.

Fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, Le Croisic, France, March 23-27, 2002: Proceedings. Vol. 4 [S.l.] : [s.n.], 2002. p. 373-387.

Research output: Chapter in Book/Report/Conference proceedingConference contributionProfessional

TY - GEN

T1 - Approaches to find a near-minimal change solution for dynamic CSPs

AU - Ran, Y.P.

AU - Roos, N.

AU - van den Herik, H.J.

N1 - Pagination: 15

PY - 2002

Y1 - 2002

M3 - Conference contribution

VL - 4

SP - 373

EP - 387

BT - Fourth international workshop on integration of AI and OR techniques in constraint programming for combinatorial optimisation problems, Le Croisic, France, March 23-27, 2002

PB - [s.n.]

CY - [S.l.]

ER -

Ran YP, Roos N, van den Herik HJ. 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, Le Croisic, France, March 23-27, 2002: Proceedings. Vol. 4. [S.l.]: [s.n.]. 2002. p. 373-387