{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T14:51:13Z","timestamp":1781189473312,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642019289","type":"print"},{"value":"9783642019296","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01929-6_23","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"309-311","source":"Crossref","is-referenced-by-count":50,"title":["Hybrid Branching"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation\u00a0(1) (2008)","DOI":"10.1007\/s12532-008-0001-1"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Operations Research Letters\u00a033, 42\u201354 (2005)","journal-title":"Operations Research Letters"},{"key":"23_CR3","unstructured":"Karzan, F.K., Nemhauser, G., Savelsbergh, M.: Information based branching rules in integer programming. Presentation at INFORMS Annual Meeting (2008)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","first-page":"342","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.M. Li","year":"1997","unstructured":"Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 342\u2013356. Springer, Heidelberg (1997)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. of Comp.\u00a048, 506\u2013521 (1999)","journal-title":"IEEE Trans. of Comp."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the DAC (July 2001)","DOI":"10.1145\/378239.379017"}],"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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01929-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T23:04:37Z","timestamp":1609196677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}