{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T12:36:58Z","timestamp":1762173418013,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_2","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"21-36","source":"Crossref","is-referenced-by-count":17,"title":["SIMPL: A\u00a0System for Integrating Optimization Techniques"],"prefix":"10.1007","author":[{"given":"Ionu\u0163","family":"Aron","sequence":"first","affiliation":[]},{"given":"John N.","family":"Hooker","sequence":"additional","affiliation":[]},{"given":"Tallys H.","family":"Yunes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics\u00a089, 3\u201344 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Kluwer, Dordrecht (2001)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"2_CR4","volume-title":"Logic Programming: Formal Methods and Practical Applications","author":"H. Beringer","year":"1995","unstructured":"Beringer, H., de Backer, B.: Combinatorial problem solving in constraint logic programming with cooperating solvers. In: Beierle, C., Pl\u00fcmer, L. (eds.) Logic Programming: Formal Methods and Practical Applications, Elsevier Science, Amsterdam (1995)"},{"key":"2_CR5","unstructured":"Berkelaar, M.: LP_SOLVE, Available from ftp:\/\/ftp.ics.ele.tue.nl\/pub\/lp_solve\/"},{"key":"2_CR6","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10720084_1","volume-title":"Frontiers of Combining Systems","author":"A. Bockmayr","year":"2000","unstructured":"Bockmayr, A., Eisenbrand, F.: Combining logic and optimization in cutting plane theory. In: Kirchner, H., Ringeissen, C. (eds.) FroCos 2000. LNCS (LNAI), vol.\u00a01794, pp. 1\u201317. Springer, Heidelberg (2000)"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr, A., Kasper, T.: Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing\u00a010(3), 287\u2013300 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR8","unstructured":"Colombani, Y., Heipcke, S.: Mosel: An Overview. Dash Optimization (2002)"},{"key":"2_CR9","unstructured":"Dash Optimization. XPRESS-MP, http:\/\/www.dashoptimization.com"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45578-7_1","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"A. Eremin","year":"2001","unstructured":"Eremin, A., Wallace, M.: Hybrid Benders decomposition algorithms in constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 1\u201315. Springer, Heidelberg (2001)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cost-based domain filtering. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 189\u2013203. Springer, Heidelberg (1999)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-45349-0_15","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"F. Focacci","year":"2000","unstructured":"Focacci, F., Lodi, A., Milano, M.: Cutting planes in constraint programming: A hybrid approach. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 187\u2013201. Springer, Heidelberg (2000)"},{"volume-title":"Traveling Salesman Problem and Its Variations","year":"2002","key":"2_CR13","unstructured":"Gutin, G., Punnen, A.P. (eds.): Traveling Salesman Problem and Its Variations. Kluwer, Dordrecht (2002)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hooker, J.N.: Logic-Based Methods for Optimization. In: Wiley-Interscience Series in Discrete Mathematics and Optimization (2000)","DOI":"10.1002\/9781118033036"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/ijoc.14.4.295.2828","volume":"14","author":"J.N. Hooker","year":"2002","unstructured":"Hooker, J.N.: Logic, optimization and constraint programming. INFORMS Journal on Computing\u00a014(4), 295\u2013321 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4615-1043-7_1","volume-title":"Computational Modeling and Problem Solving in the Networked World","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N.: A framework for integrating solution methods. In: Bhargava, H.K., Ye, M. (eds.) Computational Modeling and Problem Solving in the Networked World, pp. 3\u201330. Kluwer, Dordrecht (2003); Plenary talk at the Eighth INFORMS Computing Society Conference (ICS)"},{"key":"2_CR17","unstructured":"Hooker, J.N.: Logic-based benders decomposition for planning and scheduling. GSIA, Carnegie Mellon University (2003) (manuscript)"},{"issue":"1-3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/S0166-218X(99)00100-6","volume":"96-97","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Osorio, M.A.: Mixed logical\/linear programming. Discrete Applied Mathematics\u00a096-97(1-3), 395\u2013442 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"2_CR20","first-page":"136","volume-title":"Proceedings of the 16th National Conference on Artificial Intelligence","author":"J.N. Hooker","year":"1999","unstructured":"Hooker, J.N., Ottosson, G., Thorsteinsson, E., Kim, H.-J.: On integrating constraint propagation and linear programming for combinatorial optimization. In: Proceedings of the 16th National Conference on Artificial Intelligence, pp. 136\u2013141. MIT Press, Cambridge (1999)"},{"key":"2_CR21","first-page":"267","volume-title":"Principles and Practice of Constraint Programming: The Newport Papers","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267\u2013288. MIT Press, Cambridge (1995)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/3-540-46135-3_46","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"J.N. Hooker","year":"2002","unstructured":"Hooker, J.N., Yan, H.: A relaxation for the cumulative constraint. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 686\u2013690. Springer, Heidelberg (2002)"},{"key":"2_CR23","unstructured":"ILOG S.A. The CPLEX mixed integer linear programming and barrier optimizer, http:\/\/www.ilog.com\/products\/cplex\/"},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR25","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985)"},{"key":"2_CR26","unstructured":"Leipert, S.: The tree interface version 1.0: A tool for drawing trees, Available at http:\/\/www.informatik.uni-koeln.de\/old-ls_juenger\/projects\/vbctool.html"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.14.4.387.2830","volume":"14","author":"M. Milano","year":"2002","unstructured":"Milano, M., Ottosson, G., Refalo, P., Thorsteinsson, E.S.: The role of integer programming techniques in constraint programming\u2019s global constraints. INFORMS Journal on Computing\u00a014(4), 387\u2013402 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR28","unstructured":"Ottosson, G., Thorsteinsson, E.S., Hooker, J.N.: Mixed global constraints and inference in hybrid CLP-IP solvers. In: CP 1999 Post Conference Workshop on Large Scale Combinatorial Optimization and Constraints, pp. 57\u201378 (1999)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-540-48085-3_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"P. Refalo","year":"1999","unstructured":"Refalo, P.: Tight cooperation and its application in piecewise linear optimization. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 375\u2013389. Springer, Heidelberg (1999)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-45349-0_27","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"P. Refalo","year":"2000","unstructured":"Refalo, P.: Linear formulation of constraint programming models and hybrid solvers. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 369\u2013383. Springer, Heidelberg (2000)"},{"key":"2_CR31","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the National Conference on Artificial Intelligence, pp. 362\u2013367 (1994)"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodo\u0161ek","year":"1999","unstructured":"Rodo\u0161ek, R., Wallace, M., Hajian, M.T.: A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research\u00a086, 63\u201387 (1999)","journal-title":"Annals of Operations Research"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45578-7_2","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"E.S. Thorsteinsson","year":"2001","unstructured":"Thorsteinsson, E.S.: Branch-and-Check: A hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 16\u201330. Springer, Heidelberg (2001)"},{"key":"2_CR34","volume-title":"The OPL Optimization Programming Language","author":"P. Van Hentenryck","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)"},{"key":"2_CR35","first-page":"159","volume":"12","author":"M. Wallace","year":"1997","unstructured":"Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: A platform for constraint logic programming. ICL Systems Journal\u00a012, 159\u2013200 (1997)","journal-title":"ICL Systems Journal"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1287\/ijoc.13.2.96.10515","volume":"13","author":"H.P. Williams","year":"2001","unstructured":"Williams, H.P., Yan, H.: Representations of the all different predicate of constraint satisfaction in integer programming. INFORMS Journal on Computing\u00a013(2), 96\u2013103 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s101070050061","volume":"85","author":"H. Yan","year":"1999","unstructured":"Yan, H., Hooker, J.N.: Tight representations of logical constraints as cardinality rules. Mathematical Programming\u00a085, 363\u2013377 (1999)","journal-title":"Mathematical Programming"},{"key":"2_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-46135-3_6","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"T.H. Yunes","year":"2002","unstructured":"Yunes, T.H.: On the sum constraint: Relaxation and applications. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 80\u201392. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T18:58:53Z","timestamp":1711911533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}