A new approach to modeling and solving minimal perturbation problems

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3010, Issue , 2004, Pages 233-249

  Barták, Roman ^a   Müller, Tomáš ^a   Rudová, Hana ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR SYSTEMS; MATHEMATICAL MODELS; PERTURBATION TECHNIQUES; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; LOGIC PROGRAMMING; SPECIFICATIONS;

FORMAL DESCRIPTION; PERTURBATION PROBLEMS; PROBLEM FORMULATION; ALGORITHM FOR SOLVING; INITIAL PROBLEM; PROBLEM SPECIFICATION; REAL-LIFE PROBLEMS; STATIC CONSTRAINTS;

PROBLEM SOLVING;

EID: 9444263736     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24662-6_13     Document Type: Conference Paper

References (19)

1. Roman Barták, Tomáš Müller, and Hana Rudová. Minimal Perturbation Problem - A Formal View. Neural Network World 13(5): 501-511, 2003.
2. Mats Carlsson, Greger Ottosson, and Bjorn Carlson. An open-ended finite domain constraint solver. In Programming Languages: Implementations, Logics, and Programming. Springer-Verlag LNCS 1292, 1997.
3. Andrew M. Cheadle, Warwick Harvey, Andrew J. Sadler, Joachim Schimpf, Kish Shen and Mark G. Wallace. ECLiPSe: An Introduction. IC-Parc, Imperial College London, Technical Report IC-Parc-03-1, 2003.
4. Rina Dechter and Avi Dechter. Belief maintenance in dynamic constraint networks. In Proceedings of AAAI-88, pp. 37-42, 1998.
5. Brian Drabble, Najam-ul Haq. Dynamic Schedule Management: Lessons from the Air Campaign Planning Domain. In Pre-proceedings of the Sixth European Conference on Planning (ECP-01), pp. 193-204, 2001.
6. Hani El Sakkout, Thomas Richards, and Mark Wallace. Minimal Perturbation in Dynamic Scheduling. In Henry Prade (editor): 13th European Conference on Artificial Intelligence. ECAI-98. John Wiley & Sons, 1998.
7. Hani El Sakkout and Mark Wallace. Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling. Constraints 4(5): 359-388. Kluwer Academic Publishers, 2000.
8. Eugene C. Freuder and Richard J. Wallace. Partial Constraint Satisfaction. Artificial Intelligence, 58:21-70, 1992.
9. William D. Harvey. Nonsystematic backtracking search. PhD thesis, Stanford University, 1995.
10. William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 607-615, 1995.
11. Narendra Jussien and Olivier Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1):21-45, 2002.
12. Waldemar Kocjan. Dynamic scheduling: State of the art report, SICS Technical Report T2002:28, ISSN 100-3154, 2002.
13. Tomáš Müller and Roman Barták. Interactive Timetabling: Concepts, Techniques, and Practical Results. In Edmund Burke and Patrick De Causmaecker (eds.): Proceedings of PATAT2002, Gent, pp. 58-72, 2002.
14. Yongping Ran, Nico Roos, Jaap van den Herik. 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, pp 373-387, 2002.
15. Hana Rudová and Keith Murray. University Course Timetabling with Soft Constraints. In Edmund Burke and Patrick De Causmaecker (eds.): Practice And Theory of Automated Timetabling IV. Springer-Verlag LNCS 2740, pp. 310-328, 2003.
16. Hana Rudová, Soft CLP(FD). In Susan Haller and Ingrid Russell (eds.): Proceedings of the Sixteenth International Florida Artificial Intelligence Symposium, FLAIRS-03, AAAI Press, pp. 202-206, 2003.
17. Gérard Verfaillie, Narendra Jussien. Dynamic Constraint Solving. A tutorial including commented bibliography presented at CP 2003, Kinsale.
18. Kamil Veřmiřovský and Hana Rudová, Limited Assignment Number Search Algorithm. In Maria Bielikova (ed.): SOFSEM 2002 Student Research Forum, pp. 53-58, 2002.
19. Stefan Voß. Meta-heuristics: State of the art. In Alexander Nareyek (ed.): Local search for planning and scheduling: revisited papers. Springer-Verlag LNAI 2148, pp. 1-23, 2001.