Solving constraint optimization problems in anytime contexts

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 251-256

  Loudni, Samir ^a   Boizumault, Patrice ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT OPTIMIZATION PROBLEMS; CONSTRAINT PROPAGATION; DISCRETE OPTIMIZATION PROBLEMS; HYBRID METHOD; RESOURCE ALLOCATION PROBLEM; VARIABLE NEIGHBORHOOD SEARCH;

CONSTRAINT SATISFACTION PROBLEMS;

PROBLEM SOLVING;

EID: 32044437072     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Bistarclli, U. Montanari. F. Rossi, T. Schiex, and G Verfailhe H. Fargier. Semiring-based csps and valued csps Frameworks, properties, and comparison. Constraints, 4(3)-199-240,1999.
2. Mark Boddy and Thomas L Dean. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67.245-295,1994.
3. B. Cabon, S. de Givry, L. Lobjois, T Schiex, and J.P Warners. W.K. Radio link frequency assignment. Constraints, 4(1).79-89,1999.
4. Y. Caseau, F. Laburthe, and G. Silverstcin A meta-hcunstic factory for vehicle routing problems (meta-programming for meta-heunstics) In Proceedings oj CP-99, number 1713 in LNCS, pages 144 158, VA, USA. 1999.
5. F. Focacci, F. Laburthe, and A Lodi. Local search and constraint programming. To apear in F. Glover and G. Kochenberger (Eds) . HandBook on Metaheunstics, Kluwer Academic Publishers
6. P. Hansen and N. Mladenovic. Variable neighborhood search. Computers And Operations Research, 24 1097-1100,1997
7. Eric A Hansen and Shlomo Zilberstem Monitoring and control of anytime algorithms A dynamic programming approach. Artificial Intelligence, 126 139-157,2001
8. William D. Harvey and Matthew L. Ginsberg. Limited discrepancy search. In Proceedings of IJCAI '95, Montreal, August 1995
9. Francois Laburthe. Choco. implementing a cp kernel. In CP00 Post Conference Workshop on Techniques for Implementing Constraint programming Systems (TRICS), Singapore, September 2000.
10. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for solving max-csp. Artificial Intelligence, 107(I) 149 163,1999.
11. L. Lobjois, M. Lemaitre, and G. Verfaillie Large neighbourhood search using constraint propagation and greedy reconstruction for valued csp resolution. In Proceedings of the ECAI2000 Workshop on Modelling and Solving Problems with Constraints, 2000
12. Samir Loudni, Patrice Boizumault, and Philippe David. On-line resources allocation for atm networks with rerouting. In Proceedings of Integration oj Al and OR Techniques in Constraints Programming for Combinatioral Problems (CP-AI-OR '03), Montreal, Canada, May 2003.
13. S. Prestwich. A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In Proceedings of CP 2000, number 1894 in LNCS, pages 337-352, Singapore, September 2000.
14. Thomas Schiex, Helene Fargier, and Gerard Verfaillic. Valued constraint satisfaction problems: Hard and easy problems. In Proceedings of IJCAI '95, Montreal, August 1995.
15. Paul Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of CP-98, pages 417-431,1998.
16. C. Voudouris and E. Tsang. Solving the radio link frequency assignment problem using guided local search. In Proceedings of NATO symposium on Frequency Assignment, Sharing and Conservation in Systems, Aalborg, Denmark, 1998.
17. Shlomo Zilberstein. Using anytime algorithms in intelligent systems. Al Magazine, 17(3):73-83,1996.