Languages versus packages for constraint problem solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 37-52

  Wallace, Mark ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER SYSTEMS PROGRAMMING; CONSTRAINT THEORY;

ALGORITHM FOR SOLVING; APPLICATION DEVELOPERS; COMBINATORIAL PROBLEM; CONSTRAINT PROBLEMS; CONSTRAINT PROGRAMMING LANGUAGES;

PROBLEM SOLVING;

EID: 35048865055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_3     Document Type: Article

References (37)

1. Cycorp: A finite domain constraint solver optimized to work with opencyc (2002) For Cyc sec www.opencyc.org and for the package see "org.opencyc. constraintsolver".
2. Møller, J., Andersen, H., Hulgaard, H.: (Product configuration over the internet) citeseer.nj.nec.com/531891.html.
3. Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proceedings of the 14th ACM POPL Symposium, Munich, West Germany (1987)
4. ILOG: CPLEX (2002) www.ilog.com/products/cplex/.
5. Dash: Xpress-MP (2003) www.dashoptimization.com/products.html.
6. GAMS: GAMS: The general algebraic modeling system. (Online documentation at: www.gams.com)
7. Paragon Decision Technology B.V.: AIMMS: Advanced integrated multidimensional modeling software. (Online documentation at: www.aimms.com)
8. Software, M.: MPL: Mathematical programming language. (Online documentations at: www.maximal-usa.com/mpl/)
9. Savelsbergh, M.: MINTO - Mixed INTeger Optimizer. (Online documentations at: www.isye.gatech.edu/faculty/Martin_Savelsbergh/software/)
10. Mittelmann, H.: Benchmarks for optimization software (2003) http://plato.la.asu.edu/bench.html.
11. Bockmayr, A.: MIP model for the coins problem. Personal Communication (1997)
12. Cheadle, A., Harvey, W., Sadler, A., Schimpf, J., Shen, K., Wallace, M.: ECLiPSe: an introduction (2003) www.icparc.ic.ac.uk/eclipse/reports/icparc-03-1. pdf.
13. Glover, F.: (OptQuest: The optimization process) www.decisioneering.com/ spotlight/spotlight14d.html.
14. Abramson, D.: (Nimrod/O: A software environment for building high performance optimising decision support systems from computational models) www.csse.monash.edu.au/~davida/nimrodo/.
15. Smith, B.M., Brailsford, S., Hubbard, P., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. In: CP95: Proceedings 1st International Conference on Principles and Practice of Constraint Programming), Marseilles (1995)
16. Moscato, P.: TSPBIB home page. www.densis.fee.unicamp.br/~moscato/ TSPBIB_home.html (2000)
17. Kalvelagen, E.: On solving the progressive party problem as a MIP. Technical report, GAMS Development Corp., Washington DC (2002) www.gams.com/"erwin/ppp.pdf.
18. Nadel, B.: 9. Symbolic Computation. In: Tree Search and Arc Consistency in Constraint Satisfaction Algorithms. Springer (1988)
19. Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 (1980) 263-313
20. Bouthoorn, P.: (AlSearch) http://sal.kachinatech.eom/Z/3/AISEARCH.html.
21. Hulubei, T.: (The csp library) www.hulubei.net/tudor/csp/index.html.
22. Russell, S., Norvig, P.: (CSP problems and solvers) http://aima.cs. berkeley.edu/python/csp.html#CSP.
23. deGivry, S.: (VCSP) www.inra.fr/bia/f tp/T/VCSP/docs/vcsp.txt.
24. Kask, K., Dechter, R.: A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129 (2001) 91-131
25. Larrosa, J., Meseguer, P.: Generic CSP techniques for the job-shop problem. In: IEA/AIE (Vol. 2). volume 1416 of Lecture Notes in Computer Science., Springer (1998) 46-55
26. Minton, S.: Automatically configuring constraint satisfaction problems: A case study. Constraints 1 (1996) 7-44
27. Savelsbergh, M.: Branch-and-price: Integer programming with column generation. www.isye.gatech.edu/faculty/Martin_Savelsbergh/publications/eoo.pdf (2002)
28. Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proc. IJCAI-Vol. 1, Morgan Kaufmann, 1995 (1995) 607-615
29. Caseau, Y., Laburthe, F., Silverstein, G.: A meta-heuristic factory for vehicle routing problems. In: Proc. Principles and Practice of Constraint Programming. (1999) 144-158
30. Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence 58 (1992)
31. Selman, B., Levesque, H.J., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, AAAI Press (1992) 440-446
32. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 (1992)
33. Michel, L., Van Hentenryck, P.: Localizer. Constraints 5 (2000) 41-82
34. El Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5 (2000) 359-388
35. Laburthe, F., Caseau, Y.: SALSA: A language for search algorithms. Constraints 7 (2002) 255-288
36. de Givry, S., Jeannin, L.: ToOLS: A library for partial and hybrid search methods (2003) Presented at CPAIOR'03, Montreal, www.crt.umontreal.ca/cpaior/ article-degivry.pdf.
37. Wallace, M.G.: Search in AI - escaping from the CSP straightjacket. In: Proc. 14th European Conference on Artificial Intelligence, IOS Press (2000) 770-776