{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T15:29:00Z","timestamp":1771169340354,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642208065","type":"print"},{"value":"9783642208072","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_15","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"183-191","source":"Crossref","is-referenced-by-count":14,"title":["Backdoor Branching"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Fischetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Monaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin; Fakult\u00e4t II - Mathematik und Naturwissenschaften. Institut f\u00fcr Mathematik (2007)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G., Natraj, N.: Gomory cuts revisited. Operations Research Letters\u00a019, 1\u20139 (1996)","journal-title":"Operations Research Letters"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou, M., Gauthier, J.M., Girodet, P., Hentges, G., Ribi\u00e8re, G., Vincent, O.: Experiments in mixed integer linear programming. Mathematical Programming\u00a01, 76\u201394 (1971)","journal-title":"Mathematical Programming"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V.: Resolution search. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science\u00a073 (1997)","DOI":"10.1016\/S0166-218X(96)00003-0"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-01929-6_6","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B. Dilkina","year":"2009","unstructured":"Dilkina, B., Gomes, C.P., Malitsky, Y., Sabharwal, A., Sellmann, M.: Backdoors to Combinatorial Optimization: Feasibility and Optimality. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 56\u201370. Springer, Heidelberg (2009)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F.K. Karzan","year":"2009","unstructured":"Karzan, F.K., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed integer problems. Mathematical Programming Computation\u00a01, 249\u2013293 (2009)","journal-title":"Mathematical Programming Computation"},{"key":"15_CR7","unstructured":"MIPLIB 2010. Preliminary version, http:\/\/miplib.zip.de\/"},{"key":"15_CR8","first-page":"1173","volume-title":"IJCAI 2003: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","author":"R. Williams","year":"2003","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Gottlob, G., Walsh, T. (eds.) IJCAI 2003: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 1173\u20131178. Morgan Kaufmann, San Francisco (2003)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:16:08Z","timestamp":1560284168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}