{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:22:51Z","timestamp":1761488571672,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_7","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"96-111","source":"Crossref","is-referenced-by-count":3,"title":["SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Bemporad","sequence":"first","affiliation":[]},{"given":"Nicol\u00f2","family":"Giorgetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with constraints: an introduction","author":"K. Marriot","year":"1998","unstructured":"Marriot, K., Stuckey, P.J.: Programming with constraints: an introduction. MIT Press, Cambridge (1998)"},{"key":"7_CR2","first-page":"19","volume-title":"DIMACS Series on Discrete Mathematics and Theoretical Computer Science","author":"J. Gu","year":"1997","unstructured":"Gu, J., Purdom, P.W., Franco, J., Wah, B.: Algorithms for the satisfiability (SAT) problem: A survey. In: DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, pp. 19\u2013151. American Mathematical Society, Providence (1997)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Logic-based methods for Optimization. Wiley-Interscience Series (2000)","DOI":"10.1002\/9781118033036"},{"issue":"3","key":"7_CR4","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":"7_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1018904229454","volume":"86","author":"R. Rodosek","year":"1997","unstructured":"Rodosek, R., Wallace, M., Hajian, M.: A new approach to integrating mixed integer programming and constraint logic programming. Annals of Oper. Res.\u00a086, 63\u201387 (1997)","journal-title":"Annals of Oper. Res."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","first-page":"189","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Focacci","year":"2001","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 (2001)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0098-1354(00)00470-1","volume":"24","author":"I. Harjunkoski","year":"2000","unstructured":"Harjunkoski, I., Jain, V., Grossmann, I.E.: Hybrid mixed-integer\/constraint logic programming strategies for solving scheduling and combinatorial optimization problems. Comp. Chem. Eng.\u00a024, 337\u2013343 (2000)","journal-title":"Comp. Chem. Eng."},{"key":"7_CR8","unstructured":"Large scale integrated supply chain optimisation software. A European Union Funded Project (2003), http:\/\/www.liscos.fc.ul.pt\/"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Xu, X., Antsaklis, P.J.: An approach to switched systems optimal control based on parameterization of the switching instants. In: Proc. IFAC World Congress, Barcelona, Spain (2002)","DOI":"10.3182\/20020721-6-ES-1901.00310"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Lincoln, B., Rantzer, A.: Optimizing linear system switching. In: Proc. 40th IEEE Conf. on Decision and Control, pp. 2063\u20132068 (2001)","DOI":"10.1109\/CDC.2001.980555"},{"key":"7_CR11","unstructured":"Borrelli, F., Baotic, M., Bemporad, A., Morari, M.: An efficient algorithm for computing the state feedback optimal control law for discrete time hybrid systems. In: Proc. American Contr. Conf., Denver, Colorado (2003)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0005-1098(98)00178-2","volume":"35","author":"A. Bemporad","year":"1999","unstructured":"Bemporad, A., Morari, M.: Control of systems integrating logic, dynamics, and constraints. Automatica\u00a035(3), 407\u2013427 (1999)","journal-title":"Automatica"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Bemporad, A., Borrelli, F., Morari, M.: Piecewise linear optimal controllers for hybrid systems. In: Proc. American Contr. Conf., pp. 1190\u20131194, Chicago, IL (June 2000)","DOI":"10.1109\/ACC.2000.876688"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Torrisi, F.D., Bemporad, A.: HYSDEL - A tool for generating computational hybrid models. IEEE Transactions on Control Systems Technology\u00a012(2) (March 2004)","DOI":"10.1109\/TCST.2004.824309"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Bemporad, A., Giorgetti, N.: A logic-based hybrid solver for optimal control of hybrid systems. In: Proc. 43th IEEE Conf. On Decision and Control, Maui, Hawaii, USA (December 2003)","DOI":"10.1007\/978-3-540-24743-2_9"},{"key":"7_CR16","volume-title":"Model Building in Mathematical Programming","author":"H.P. Williams","year":"1993","unstructured":"Williams, H.P.: Model Building in Mathematical Programming, 3rd edn. John Wiley & Sons, Chichester (1993)","edition":"3"},{"key":"7_CR17","unstructured":"Ottosson, G.: Integration of Constraint Programming and Integer Programming for Combinatorial Optimization. PhD thesis, Computing Science Department, Information Technology, Uppsala University, Sweden (2000)"},{"key":"7_CR18","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization (2003) (in press), http:\/\/www.stanford.edu\/char126relaxboyd\/cvxbook.html","DOI":"10.1017\/CBO9780511804441"},{"issue":"1-3","key":"7_CR20","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":"7_CR21","doi-asserted-by":"crossref","unstructured":"Bemporad, A.: Efficient conversion of mixed logical dynamical systems into an equivalent piecewise affine form. IEEE Trans. Automatic Control (2003) (in Press)","DOI":"10.1109\/TAC.2004.828315"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: 39th Design Automation Conference (June 2001), http:\/\/www.ee.princeton.edu\/char126relaxchaff\/zchaff.php","DOI":"10.1145\/378239.379017"},{"key":"7_CR23","unstructured":"ILOG, Inc. CPLEX 8.1 User Manual. Gentilly Cedex, France (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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T04:19:42Z","timestamp":1740629982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}