{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T03:57:16Z","timestamp":1784260636913,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_6","type":"book-chapter","created":{"date-parts":[[2009,5,16]],"date-time":"2009-05-16T09:09:16Z","timestamp":1242464956000},"page":"56-70","source":"Crossref","is-referenced-by-count":15,"title":["Backdoors to Combinatorial Optimization: Feasibility and Optimality"],"prefix":"10.1007","author":[{"given":"Bistra","family":"Dilkina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuri","family":"Malitsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish","family":"Sabharwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meinolf","family":"Sellmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters\u00a034(4), 1\u201312 (2006), \n                      http:\/\/miplib.zib.de","journal-title":"Operations Research Letters"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R.E. Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: A decade and more of progress. Oper. Res.\u00a050(1), 3\u201315 (2002)","journal-title":"Oper. Res."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-540-74970-7_20","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"B. Dilkina","year":"2007","unstructured":"Dilkina, B., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 256\u2013270. Springer, Heidelberg (2007)"},{"key":"6_CR4","first-page":"335","volume":"70","author":"I.P. Gent","year":"1994","unstructured":"Gent, I.P., Walsh, T.: Easy problems are sometimes hard. AI J.\u00a070, 335\u2013345 (1994)","journal-title":"AI J."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.P. Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"6_CR6","unstructured":"Gomes, C.P., Selman, B., McAloon, K., Tretkoff, C.: Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In: 4th Int. Conf. Art. Intel. Planning Syst. (1998)"},{"key":"6_CR7","first-page":"1310","volume-title":"Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994)","author":"T. Hogg","year":"1994","unstructured":"Hogg, T., Williams, C.: Expected gains from parallelizing constraint solving for hard problems. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), Seattle, WA, pp. 1310\u20131315. AAAI Press, Menlo Park (1994)"},{"key":"6_CR8","unstructured":"ILOG, SA. CPLEX 10.1 Reference Manual (2006)"},{"key":"6_CR9","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: 15th IJCAI, Nagoya, Japan, pp. 366\u2013371 (August 1997)"},{"key":"6_CR10","unstructured":"Smith, B.M., Grant, S.A.: Sparse constraint graphs and exceptionally hard problems. In: 14th IJCAI, Montreal, Canada, vol.\u00a01, pp. 646\u2013654 (August 1995)"},{"key":"6_CR11","unstructured":"Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: 18th IJCAI, Acapulco, Mexico, pp. 1173\u20131178 (August 2003)"},{"key":"6_CR12","unstructured":"Williams, R., Gomes, C., Selman, B.: On the connections between heavy-tails, backdoors, and restarts in combinatorial search. In: 6th SAT, Santa Margherita Ligure, Italy, pp. 222\u2013230 (May 2003)"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T23:03:56Z","timestamp":1609196636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01929-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019289","9783642019296"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01929-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}