Comet in Context

Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop

Volumn , Issue , 2003, Pages 95-107

  Michel, Laurent ^a   Van Hentenryck, Pascal ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b BROWN UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Constraint programming; Incremental algorithms; Neighborhood search

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DIGITAL LIBRARIES; HEURISTIC METHODS;

REUSABLE LIBRARIES;

OBJECT ORIENTED PROGRAMMING;

EID: 0141975320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/778348.778361     Document Type: Conference Paper

References (56)

1. N. Beldiceanu and M. Carlsson. Revisiting the cardinality Operator. In ICLP-01, Cyprus, 2001.
2. R. Bent and P. Van Hentenryck. A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows. Transportation Science, 2001. (To Appear).
3. F. Berthier. Using CHIP to support decision making. In Actes du Séminaire 1988 - Programmation en Logique, (Trégastel, France), May 1988.
4. A. Bockmayr and A. Courtois. Using Hybrid Concurrent Constraint Programming to Model Dynamic Biological Systems. In ICLP-2002, pages 85-99, Copenhagen, Denmark, 2002.
5. A. Burning. The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory. ACM Transaction on Programming Languages and Systems, 3(4):353-387, 1981.
6. C. Codognet and D. Diaz. Yet Another Local Search Method for Constraint Solving. In AAAI Fall Symposium on Using Uncertainty within Computation, Cape Cod, MA., 2001.
7. A. Colmerauer. PROLOG II: Manuel de Reférence et Modèle Théorique. Technical report, GIA - Faculté de Sciences de Luminy, March 1982.
8. A. Colmerauer. An Introduction to Prolog III. Commun. ACM, 28(4):412-418, 1990.
9. B. De Backer, V. Furnon, P. Shaw, P. Kilby, and P. Prosser. Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. Journal of Heuristics, 6:501-523, 2000.
10. L. Di Gaspero and A. Schaerf. Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using EasyLocal++. Kluwer, 2002.
11. M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, December 1988.
12. R. Fourer, D. Gay, and B. Kernighan. AMPL: A Modeling Language for Mathematical Programming. The Scientific Press, San Francisco, CA, 1993.
13. P. Galinier and J.-K. Hao. A General Approach for Constraint Solving by Local Search. In CP-AI-OR'00, Paderborn, Germany, March 2000.
14. A. Gotlieb, B. Botella, and M. Rueher. A CLP Framework for Computing Structural Test Data. In Proceedings of the First International Conference on Computational Logic, London, UK, July 2000.
15. T. Graf, P. Van Hentenryck, C. Pradelles, and L. Zimmer. Simulation of hybrid circuits in constraint logic programming. In International Joint Conference on Artificial Intelligence, Detroit, Michigan, August 1989.
16. V. Gupta, R. Jagadeesan, and V. Saraswat. Hybrid cc, Hybrid Automata, and Program Verification. In Hybrid Systems, pages 52-63, 1995.
17. W. Harvey and M. Ginsberg. Limited Discrepancy Search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, August 1995.
18. N. Heintze, S. Michaylov, and P. Stuckey. CLP(ℛ) and some electrical engineering problems. In the 4th International Conference on Logic Programming, (Melbourne, Australia), May 1987. The MIT Press.
19. T. Huynh and C. Lassez. A CLP(ℛ) option trading analysis system. In the 5th International Conference on Logic Programming, (Seattle, WA), August 1988. The MIT Press.
20. Ilog Solver 4.4. Reference Manual. Ilog SA, Gentilly, France, 1998.
21. J. Jaffar and J.-L. Lassez. Constraint logic programming. In POPL-87, (Munich, Germany), January 1987.
22. P. Kanellakis, G. Hillebrand, and H. Mairson. An Analysis of Core-ML: Expressive Power and Type Inference. In International Colloquium on Automata, Languages and Programming, pages 83-105, Jerusalem, Israel, July 1994.
23. P. Kanellakis, G. Kuper, and P. Revesz. Constraint Query Languages. In PODS-90, Nashville, Te, 1990.
24. P. Kanellakis and C. Papadimitriou. Local Search for the Asymmetric Traveling Salesman Problem. Operations Research, 27(3):533-549, 1980.
25. Kindervater, G. and Savelsbergh, M.W. Vehicle routing: Handling edge exchanges. In E. Aarts and J. Lenstra, editors, Local Search in Combinatorial Optimization, pages 482-520. Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Ltd, England, 1997.
26. W. Kohn, A. Nerode, and V. Subrhamanian. Constraint Logic Programming: Hybrid Control and Logic as Linear Programming. In V. Saraswat and P. V. Hentenryck, editors, Principles and Practice of Constraint Programming, pages 85-100. The MIT Press, Cambridge, Massachusetts, 1995.
27. F. Laburthe and Y. Caseau. SALSA: A Language for Search Algorithms. In Fourth International Conference on the Principles and Practice of Constraint Programming (CP'98), Pisa, Italy, October 1998.
28. D. M. and T. M. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252, 1993.
29. A. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99-118, 1977.
30. L. Michel and P. Van Hentenryck. Localizer: A Modeling Language for Local Search. Informs Journal on Computing, 11(1):1-14, 1999.
31. L. Michel and P. Van Hentenryck. Localizer. Constraints, 5:41-82, 2000.
32. L. Michel and P. Van Hentenryck. A constraint-based architecture for local search. In Conference on Object-Oriented Programming Systems, Languages, and Applications., pages 101-110, Seattle, WA, USA, November 4-8 2002. ACM.
33. S. Minton, M. Johnston, and A. Philips. Solving Large-Scale Constraint Satisfaction and Scheduling Problems using a Heuristic Repair Method. In AAAI-90, August 1990.
34. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Science, 7(2):95-132, 1974.
35. A. Nareyek. Constraint-Based Agents. Springer Verlag, 1998.
36. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797-813, 1996.
37. L. Perron. Search Procedures and Parallelism in Constraint Programming. In Fifth International Conference on the Principles and Practice of Constraint Programming (CP'99), Alexandra, VA, October 1999.
38. J.-C. Régin. A filtering algorithm for constraints of difference in CSPs. In AAAI-94, proceedings of the Twelth National Conference on Artificial Intelligence, pages 362-367, Seattle, Washington, 1994.
39. B. Roy and B. Sussmann. Les problèmes d'ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA. Paris, France, 1964.
40. K. Schmidt. Using Tabu-search to Solve the Job-Shop Scheduling Problem with Sequence Dependent Setup Times. ScM Thesis, Brown University, 2001.
41. C. Schulte. Programming Constraint Inference Engines. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, pages 519-533, Linz, Austria, October 1997.
42. C. Schulte. Comparing trailing and copying for constraint programming. In D. D. Schreye, editor, Proceedings of the Sixteenth International Conference on Logic Programming, pages 275-289, Las Cruces, NM, USA, Nov. 1999. The MIT Press.
43. B. Selman, H. Kautz, and B. Cohen. Noise Strategies for Improving Local Search. In AAAI-94, pages 337-343, 1994.
44. P. Shaw, B. De Backer, and V. Furnon. Improved local search for CP toolkits. Annals of Operations Research, 115:31-50, 2002.
45. H. Simonis and M. Dincbas. Using an extended prolog for digital circuit design. In IEEE International Workshop on AI Applications to CAD Systems for Electronics, pages 165-188, (Munich, Germany), October 1987. IEEE, New York.
46. G. Smolka. The Oz Programming Model. In J. van Leeuwen, editor, Computer Science Today. LNCS, No. 1000, Springer Verlag, 1995.
47. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series, The MIT Press, Cambridge, MA, 1989.
48. P. Van Hentenryck. Visual Solver: A Modeling Language for Constraint Programming. In Third International Conference on the Principles and Practice of Constraint Programming (CP'97), Lintz, Austria, October 1997. (Invited Talk).
49. P. Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, Cambridge, Mass., 1999.
50. P. Van Hentenryck and Y. Deville. The Cardinality Operator: A New Logical Connective and its Application to Constraint Logic Programming. In ICLP-91, June 1991.
51. P. Van Hentenryck and M. Dincbas. Domains in Logic Programming. In AAAI-86, Philadelphia, PA, August 1986.
52. P. Van Hentenryck and L. Michel. Control Abstractions for Local Search. Technical Report CS-03-06, Brown University, April 2003.
53. P. Van Hentenryck, L. Perron, and J.-F. Puget. Search Strategies in OPL. ACM Transactions on Computational Logic 1(2): 1-36 October 2000.
54. S. Voss and D. Woodruff. Optimization Software Class Libraries. Kluwer Academic Publishers, 2002.
55. J. Walser. Integer Optimization by Local Search. Springer Verlag, 1998.
56. D. Waltz. Generating Semantic Descriptions from Drawings of Scenes with Shadows. Technical Report AI271, MIT, MA, November 1972.