{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:51:55Z","timestamp":1753275115641},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_17","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T13:26:33Z","timestamp":1496150793000},"page":"211-220","source":"Crossref","is-referenced-by-count":14,"title":["Experiments with Conflict Analysis in Mixed Integer Programming"],"prefix":"10.1007","author":[{"given":"Jakob","family":"Witzig","sequence":"first","affiliation":[]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007)","journal-title":"Discrete Optim."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Achterberg, T.: Constraint integer programming (2007)","DOI":"10.1007\/978-3-540-72397-4_3"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 309\u2013311. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01929-6_23"},{"issue":"4","key":"17_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"17_CR5","doi-asserted-by":"crossref","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. Math. Program. 1(1), 76\u201394 (1971)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"17_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10107-013-0635-2","volume":"144","author":"T Berthold","year":"2014","unstructured":"Berthold, T., Gleixner, A.M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP. Math. Program. 144(1\u20132), 315\u2013346 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"17_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10732-014-9271-0","volume":"21","author":"T Berthold","year":"2015","unstructured":"Berthold, T., Hendel, G.: Shift-and-propagate. J. Heuristics 21(1), 73\u2013106 (2015)","journal-title":"J. Heuristics"},{"key":"17_CR8","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A Brearley","year":"1975","unstructured":"Brearley, A., Mitra, G., Williams, H.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8, 54\u201383 (1975)","journal-title":"Math. Program."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-69346-7_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Cornu\u00e9jols","year":"1998","unstructured":"Cornu\u00e9jols, G., Dawande, M.: A class of hard small 0-1 programs. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 284\u2013293. Springer, Heidelberg (1998). doi: 10.1007\/3-540-69346-7_22"},{"issue":"3","key":"17_CR11","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"RJ Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250\u2013255 (1965)","journal-title":"Comput. J."},{"issue":"4","key":"17_CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/ijoc.14.4.373.2823","volume":"14","author":"B Davey","year":"2002","unstructured":"Davey, B., Boland, N., Stuckey, P.J.: Efficient intelligent backtracking using linear programming. INFORMS J. Comput. 14(4), 373\u2013386 (2002)","journal-title":"INFORMS J. Comput."},{"key":"17_CR13","unstructured":"Gamrath, G., Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, T., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, C., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Vigerske, S., Weninger, D., Winkler, M., Witt, J.T., Witzig, J.: The SCIP optimization suite 3.2. Technical Report 15\u201360, ZIB, Takustr. 7, 14195 Berlin (2016)"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"ML Ginsberg","year":"1993","unstructured":"Ginsberg, M.L.: Dynamic backtracking. J. Artif. Intell. Res. 1, 25\u201346 (1993)","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Richards, T., Richards, B.: No-good backmarking with min-conflict repair in constraint satisfaction and optimization. In: PPCP, vol. 94, pp. 2\u20134. Citeseer (1994)","DOI":"10.1007\/3-540-58601-6_87"},{"issue":"4","key":"17_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s12532-009-0009-1","volume":"1","author":"F K\u0131l\u0131n\u00e7 Karzan","year":"2009","unstructured":"K\u0131l\u0131n\u00e7 Karzan, F., Nemhauser, G.L., Savelsbergh, M.W.P.: Information-based branching schemes for binary linear mixed-integer programs. Math. Program. Comput. 1(4), 249\u2013293 (2009)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"17_CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"17_CR18","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"17_CR19","first-page":"253","volume":"3","author":"JT Linderoth","year":"2005","unstructured":"Linderoth, J.T., Ralphs, T.K.: Noncommercial software for mixed-integer linear programming. Integer Program.: Theor. Pract. 3, 253\u2013303 (2005)","journal-title":"Integer Program.: Theor. Pract."},{"issue":"2","key":"17_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"17_CR21","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.: Grasp: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR22","unstructured":"P\u00f3lik, I.: (Re)using dual information in MILP. In: INFORMS Computing Society Conference, Richmond, VA (2015)"},{"key":"17_CR23","unstructured":"P\u00f3lik, I.: Some more ways to use dual information in MILP. In: International Symposium on Mathematical Programming, Pittsburgh, PA (2015)"},{"key":"17_CR24","unstructured":"Sandholm, T., Shields, R.: Nogood learning for mixed integer programming. In: Workshop on Hybrid Methods and Branching Rules in Combinatorial Optimization, Montr\u00e9al (2006)"},{"issue":"2","key":"17_CR25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","volume":"9","author":"RM Stallman","year":"1977","unstructured":"Stallman, R.M., Sussman, G.J.: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artif. Intell. 9(2), 135\u2013196 (1977)","journal-title":"Artif. Intell."},{"key":"17_CR26","unstructured":"Witzig, J., Berthold, T., Heinz, S.: Experiments with conflict analysis in mixed integer programming. Technical report 16\u201363, ZIB, Takustr. 7, 14195 Berlin (2016)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T23:18:34Z","timestamp":1602199114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}