{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T14:36:06Z","timestamp":1775486166719,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441205","type":"print"},{"value":"9783540461357","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_1","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"1-16","source":"Crossref","is-referenced-by-count":13,"title":["Reduced Cost-Based Ranking for Generating Promising Subproblems"],"prefix":"10.1007","author":[{"given":"Michela","family":"Milano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem J.","family":"van Hoeve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"1_CR1","unstructured":"N. Ascheuer. ATSPTW-Problem instances. http:\/\/www.zib.de\/ascheuer\/ATSPTWinstances.html ."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"G. Carpaneto, S. Martello, and P. Toth. Algorithms and codes for the Assignment Problem. In B. Simeone et al., editor, Fortran Codes for Network Optimization-Annals of Operations Research, pages 193\u2013223. 1988.","DOI":"10.1007\/BF02288323"},{"key":"1_CR3","unstructured":"M. Dell\u2019Amico and S. Martello. Linear assignment. In F. Maffioli M. Dell\u2019Amico and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 355\u2013371. Wiley, 1997."},{"key":"1_CR4","unstructured":"T. Fahle and M. Sellman. Cp-based lagrangean relaxation for a multi-media application. In M. Wallace Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming [13], 2001."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109\u2013133, 1995.","journal-title":"Journal of Global Optimization"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/opre.37.2.319","volume":"37","author":"M. Fischetti","year":"1989","unstructured":"M. Fischetti and P. Toth. An additive bounding procedure for combinatorial optimization problems. Operations Research, 37:319\u2013328, 1989.","journal-title":"Operations Research"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01585701","volume":"53","author":"M. Fischetti","year":"1992","unstructured":"M. Fischetti and P. Toth. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming, 53:173\u2013197, 1992.","journal-title":"Mathematical Programming"},{"key":"1_CR8","unstructured":"F. Focacci, P. Laborie, and W. Nuijten. Solving scheduling problems with setup times and alternative resources. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS2000), 2000."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi, and M. Milano. Cost-based domain filtering. In CP\u201999 Conference on Principles and Practice of Constraint Programming, pages 189\u2013203, 1999.","DOI":"10.1007\/978-3-540-48085-3_14"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi, and M. Milano. A hybrid exact algorithm for the TSPTW. INFORMS Journal of Computing, to appear. Special issue on The merging of Mathematical Programming and Constraint Programming.","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"1_CR11","unstructured":"F. Focacci, A. Lodi, M. Milano, and D. Vigo Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 1999."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"F. Focacci, A. Lodi, M. Milano, and D. Vigo. Solving TSP through the integration of OR and CP techniques. Proc. CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints, 1998.","DOI":"10.1016\/S1571-0653(04)00002-2"},{"key":"1_CR13","unstructured":"C. Gervet and M. Wallace Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2001."},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","volume":"55","author":"M. L. Ginsberg","year":"1992","unstructured":"M. L. Ginsberg and W. D. Harvey. Iterative broadening. Artificial Intelligence, 55(2):367\u2013383, 1992.","journal-title":"Artificial Intelligence"},{"key":"1_CR15","unstructured":"W. D. Harvey and M. L. Ginsberg. Limited Discrepancy Search. In C. S. Mellish, editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95); Vol. 1, pages 607\u2013615, 1995."},{"key":"1_CR16","unstructured":"ILOG. ILOG Scheduler 4.4, Reference Manual, 2000."},{"key":"1_CR17","unstructured":"ILOG. ILOG Solver 4.4, Reference Manual, 2000."},{"key":"1_CR18","unstructured":"U. Junker, S. Karisch, and S. Tschoeke Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2000."},{"key":"1_CR19","unstructured":"F. Laburthe and N. Jussien Eds. Proceedings of the International Workshop on the Integration of Artificial Intelligence and Operations Research techniques in Constraint Programming, 2002."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"P. Langley. Systematic and nonsystematic search strategies. In Proceedings of the 1st International Conference on AI Planning Systems, pages 145\u2013152, 1992.","DOI":"10.1016\/B978-0-08-049944-4.50022-7"},{"key":"1_CR21","unstructured":"A. Lodi. Personal communication."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01580850","volume":"47","author":"M. Padberg","year":"1990","unstructured":"M. Padberg and G. Rinaldi. An efficient algorithm for the minimum capacity cut problem. Mathematical Programming, 47:19\u201336, 1990.","journal-title":"Mathematical Programming"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"G. Reinelt. TSPLIB-a Travelling Salesman Problem Library. ORSA Journal on Computing, 3:376\u2013384, 1991.","journal-title":"ORSA Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T17:19:46Z","timestamp":1683825586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}