{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:22:46Z","timestamp":1756635766568},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_3","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T23:35:03Z","timestamp":1283988903000},"page":"37-52","source":"Crossref","is-referenced-by-count":2,"title":["Languages versus Packages for Constraint Problem Solving"],"prefix":"10.1007","author":[{"given":"Mark","family":"Wallace","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Cycorp: A finite domain constraint solver optimized to work with opencyc (2002), For Cyc see www.opencyc.org and for the package see org.opencyc.constraintsolver"},{"key":"3_CR2","unstructured":"M\u00f8ller, J., Andersen, H., Hulgaard, H.: Product configuration over the internet, citeseer.nj.nec.com\/531891.html"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Lassez, J.L.: Constraint logic programming. In: Proceedings of the 14th ACM POPL Symposium, Munich, West Germany (1987)","DOI":"10.1145\/41625.41635"},{"key":"3_CR4","unstructured":"ILOG: CPLEX (2002), http:\/\/www.ilog.com\/products\/cplex\/"},{"key":"3_CR5","unstructured":"Dash: Xpress-MP (2003), http:\/\/www.dashoptimization.com\/products.html"},{"key":"3_CR6","unstructured":"GAMS: GAMS: The general algebraic modeling system, Online documentation at http:\/\/www.gams.com"},{"key":"3_CR7","unstructured":"Paragon Decision Technology B.V.: AIMMS: Advanced integrated multidimensional modeling software ,Online documentation at http:\/\/www.aimms.com"},{"key":"3_CR8","unstructured":"Software, M.: MPL: Mathematical programming language, Online documentations at http:\/\/www.maximal-usa.com\/mpl\/"},{"key":"3_CR9","unstructured":"Savelsbergh, M.: MINTO - Mixed INTeger Optimizer, Online documentations at http:\/\/www.isye.gatech.edu\/faculty\/Martin_Savelsbergh\/software\/"},{"key":"3_CR10","unstructured":"Mittelmann, H.: Benchmarks for optimization software (2003), http:\/\/plato.la.asu.edu\/bench.html"},{"key":"3_CR11","unstructured":"Bockmayr, A.: MIP model for the coins problem. Personal Communication (1997)"},{"key":"3_CR12","unstructured":"Cheadle, A., Harvey, W., Sadler, A., Schimpf, J., Shen, K., Wallace, M.: ECLiPSe: an introduction (2003), http:\/\/www.icparc.ic.ac.uk\/eclipse\/reports\/icparc-03-1.pdf"},{"key":"3_CR13","unstructured":"Glover, F.: OptQuest: The optimization process , http:\/\/www.decisioneering.com\/spotlight\/spotlight14d.html"},{"key":"3_CR14","unstructured":"Abramson, D.: Nimrod\/O: A software environment for building high performance optimising decision support systems from computational models, http:\/\/www.csse.monash.edu.au\/~davida\/nimrodo\/"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Smith, B.M., Brailsford, S., Hubbard, P., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. In: CP 1995: Proceedings 1st International Conference on Principles and Practice of Constraint Programming, Marseilles (1995)","DOI":"10.1007\/3-540-60299-2_3"},{"key":"3_CR16","unstructured":"Moscato, P.: TSPBIB home page (2000), http:\/\/www.densis.fee.unicamp.br\/~moscato\/TSPBIB_home.html"},{"key":"3_CR17","unstructured":"Kalvelagen, E.: On solving the progressive party problem as a MIP. Technical report, GAMS Development Corp., Washington DC (2002), http:\/\/www.gams.com\/~erwin\/ppp.pdf"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Nadel, B.: 9. Symbolic Computation. In: Tree Search and Arc Consistency in Constraint Satisfaction Algorithms. Springer (1988)","DOI":"10.1007\/978-1-4613-8788-6_9"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence\u00a014, 263\u2013313 (1980)","journal-title":"Artificial Intelligence"},{"key":"3_CR20","unstructured":"Bouthoorn, P.: AISearch, http:\/\/sal.kachinatech.com\/Z\/3\/AISEARCH.html"},{"key":"3_CR21","unstructured":"Hulubei, T.: The csp library, http:\/\/www.hulubei.net\/tudor\/csp\/index.html"},{"key":"3_CR22","unstructured":"Russell, S., Norvig, P.: CSP problems and solvers, http:\/\/aima.cs.berkeley.edu\/python\/csp.html#CSP"},{"key":"3_CR23","unstructured":"de Givry, S.: VCSP, http:\/\/www.inra.fr\/bia\/ftp\/T\/VCSP\/docs\/vcsp.txt"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0004-3702(01)00107-2","volume":"129","author":"K. Kask","year":"2001","unstructured":"Kask, K., Dechter, R.: A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence\u00a0129, 91\u2013131 (2001)","journal-title":"Artificial Intelligence"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-64574-8_390","volume-title":"Tasks and Methods in Applied Artificial Intelligence","author":"J. Larrosa","year":"1998","unstructured":"Larrosa, J., Meseguer, P.: Generic CSP techniques for the job-shop problem. In: Mira, J., Moonis, A., de Pobil, A.P. (eds.) IEA\/AIE 1998. LNCS, vol.\u00a01416, pp. 46\u201355. Springer, Heidelberg (1998)"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00143877","volume":"1","author":"S. Minton","year":"1996","unstructured":"Minton, S.: Automatically configuring constraint satisfaction problems: A case study. Constraints\u00a01, 7\u201344 (1996)","journal-title":"Constraints"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Savelsbergh, M.: Branch-and-price: Integer programming with column generation (2002), http:\/\/www.isye.gatech.edu\/faculty\/Martin_Savelsbergh\/publications\/eoo.pdf","DOI":"10.1007\/0-306-48332-7_47"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proc. IJCAI 1995, vol.\u00a01, pp. 607\u2013615 (1995)","DOI":"10.1016\/0003-4975(95)00537-U"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Laburthe, F., Silverstein, G.: A meta-heuristic factory for vehicle routing problems. In: Proc. Principles and Practice of Constraint Programming, pp. 144\u2013158 (1999)","DOI":"10.1007\/978-3-540-48085-3_11"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Freuder, E., Wallace, R.: Partial constraint satisfaction. Artificial Intelligence\u00a058 (1992)","DOI":"10.1016\/0004-3702(92)90004-H"},{"key":"3_CR31","first-page":"440","volume-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","author":"B. Selman","year":"1992","unstructured":"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, pp. 440\u2013446. AAAI Press, Menlo Park (1992)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058 (1992)","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L. Michel","year":"2000","unstructured":"Michel, L., Van Hentenryck, P.: Localizer. Constraints\u00a05, 41\u201382 (2000)","journal-title":"Constraints"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H. Sakkout El","year":"2000","unstructured":"El Sakkout, H., Wallace, M.: Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints\u00a05, 359\u2013388 (2000)","journal-title":"Constraints"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1020565317875","volume":"7","author":"F. Laburthe","year":"2002","unstructured":"Laburthe, F., Caseau, Y.: SALSA: A language for search algorithms. Constraints\u00a07, 255\u2013288 (2002)","journal-title":"Constraints"},{"key":"3_CR36","unstructured":"de Givry, S., Jeannin, L.: ToOLS: A library for partial and hybrid search methods. Presented at CPAIOR 2003 Montreal (2003), http:\/\/www.crt.umontreal.ca\/cpaior\/article-degivry.pdf"},{"key":"3_CR37","first-page":"770","volume-title":"Proc. 14th European Conference on Artificial Intelligence","author":"M.G. Wallace","year":"2000","unstructured":"Wallace, M.G.: Search in AI - escaping from the CSP straightjacket. In: Proc. 14th European Conference on Artificial Intelligence, pp. 770\u2013776. IOS Press, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T06:50:55Z","timestamp":1685775055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}