{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:43Z","timestamp":1725664243591},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:14:54Z","timestamp":1330280094000},"page":"533-548","source":"Crossref","is-referenced-by-count":2,"title":["Improved branch and bound in constraint logic programming"],"prefix":"10.1007","author":[{"given":"Steven","family":"Prestwich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shyam","family":"Mudambi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"unstructured":"A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. In Proc. of JFPL'92, 1992.","key":"32_CR1"},{"issue":"2","key":"32_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"J. Carlier and E. Pinson. An algorithm for solving the job shop problem. Management Science, 35(2), 2 1989.","journal-title":"Management Science"},{"unstructured":"Yves Caseau and Francois Laburthe. Improved CLP scheduling with task intervals. In Proc. of Eleventh International Conference on Logic Programming, pages 369\u2013383. The MIT Press, 1994.","key":"32_CR3"},{"doi-asserted-by":"crossref","unstructured":"D. Clark, C. Rawlings, J. Shirazi, Liang liang Li, Mike Reeve, Kees Schuermann, and Andre Veron. Solving large combinatorial problems in molecular biology using the ElipSys parallel constraint logic programming system. Computer Journal, 36(4), 1993.","key":"32_CR4","DOI":"10.1093\/comjnl\/36.8.690"},{"unstructured":"Jean-Yves Cras. A review of industrial constraint solving tools, survey, AI Perspectives, 1994.","key":"32_CR5"},{"key":"32_CR6","volume-title":"Technical Report 94\/50","author":"C. G. Diderich","year":"1994","unstructured":"Claude G. Diderich and Marc Gengler. A survey of minimax trees and associated algorithms. Technical Report 94\/50, Swiss Federal Institute of Technology, Lausanne, 1994."},{"unstructured":"M. Dincbas et al. The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pages 693\u2013702. ICOT, 1988.","key":"32_CR7"},{"unstructured":"European Computer-Industry Research Centre, Munich, Germany. ECLiPSe 3.5.1 User Manual, 1995.","key":"32_CR8"},{"unstructured":"Pascal Van Hentenryck. Personal communication, January 1995.","key":"32_CR9"},{"doi-asserted-by":"crossref","unstructured":"V. Kumar and V.N. Rao. Parallel depth first search \u2014 Part I. Implementation. International Journal of Parallel Programming, 16(6), 1987.","key":"32_CR10","DOI":"10.1007\/BF01389001"},{"doi-asserted-by":"crossref","unstructured":"V. Kumar and V.N. Rao. Parallel depth first search \u2014 Part II. Analysis. International Journal of Parallel Programming, 16(6), 1987.","key":"32_CR11","DOI":"10.1007\/BF01389001"},{"unstructured":"Ewing Lusk, Ralph Butler, Terence Disz, Robert Oison, Ross Overbeek, Rick Stevens, D.H.D Warren, Alan Calderwood, Peter Szerdi, Seif Haridi, Per Brand, Mats Carlsson, Andrzej Ciepielewski, and Bogumil Hausman. The Aurora Or-Parallel Prolog system. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88). ICOT, 1988.","key":"32_CR12"},{"key":"32_CR13","volume-title":"Industrial Scheduling","author":"J. F. Muth","year":"1963","unstructured":"J. F. Muth and G. L. Thompson. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, New Jersey, 1963."},{"unstructured":"Steven Prestwich and Shyam Mudambi. Cost-parallel branch and bound in CLP. In Proc. of ILPS 1994 post-conference workshop on Constraint Languages and Systems, pages 141\u2013149, 1994. Available as an ECRC technical report no. 94-38.","key":"32_CR14"},{"unstructured":"T.J. Reynold and P. Kefalas. Or-parallel prolog and search problems in AI applications. In Logic Programming: Proceedings of the Seventh Internatinal Conference, pages 340\u2013354. MIT Press, 1990.","key":"32_CR15"},{"unstructured":"Peter Szeredi. Exploiting or-parallelism in optimisation problems. In Proceedings of the JICSLP'92, pages 703\u2013716. MIT Press, 1992.","key":"32_CR16"},{"key":"32_CR17","first-page":"165","volume-title":"Parallel constraint satisfaction in logic programming: Preliminary results of chip within PEPSys","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck. Parallel constraint satisfaction in logic programming: Preliminary results of chip within PEPSys. In Giorgio Levi and Maurizio Martelli, editors, Proceedings of the Sixth International Conference on Logic Programming, pages 165\u2013180, Lisbon, 1989. The MIT Press."},{"unstructured":"A. Veron, K. Schuerman, M. Reeve, and L. Li. APPLAUSE: Applications using the ElipSys parallel CLP system. In Proceedings of the Tenth International Conference on Logic Programming. MIT Press, June 1993.","key":"32_CR18"},{"doi-asserted-by":"crossref","unstructured":"A. Veron, K. Schuerman, M. Reeve, and L. Li. Why and how in the ElipSys Or-Parallel CLP system. In PARLE'93: Parallel Architectures and Languages Europe, pages 291\u2013302. Springer-Verlag, 1993.","key":"32_CR19","DOI":"10.1007\/3-540-56891-3_23"},{"doi-asserted-by":"crossref","unstructured":"M. Wallace. Constraints in planning, scheduling and placement problems. In Constraint Programming. Springer-Verlag, 1994.","key":"32_CR20","DOI":"10.1007\/978-3-642-85983-0_7"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:58Z","timestamp":1605646678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}