{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T09:00:32Z","timestamp":1767085232058,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184995"},{"type":"electronic","value":"9783030185008"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18500-8_64","type":"book-chapter","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:02:47Z","timestamp":1567090967000},"page":"513-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive Algorithmic Behavior for Solving Mixed Integer Programs Using Bandit Algorithms"],"prefix":"10.1007","author":[{"given":"Gregor","family":"Hendel","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Miltenberger","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Witzig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"issue":"1","key":"64_CR1","doi-asserted-by":"publisher","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. Discret. Optim. 4(1), 4\u201320 (2007). \n                    https:\/\/dx.doi.org\/10.1016\/j.disopt.2006.10.006","journal-title":"Discret. Optim."},{"issue":"1","key":"64_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. Oper. Res. Lett. 33(1), 42\u201354 (2005). \n                    https:\/\/dx.doi.org\/10.1016\/j.orl.2004.04.002","journal-title":"Oper. Res. Lett."},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-77903-2_5","volume-title":"Operations Research Proceedings 2007","author":"T Berthold","year":"2008","unstructured":"Berthold, T.: Heuristics of the branch-cut-and-price-framework SCIP. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007, pp. 31\u201336. Springer, Berlin (2008). \n                    https:\/\/dx.doi.org\/10.1007\/978-3-540-77903-2_5"},{"key":"64_CR4","unstructured":"Berthold, T.: Heuristic algorithms in global MINLP solvers, Ph.D. thesis, TU Berlin (2014)"},{"issue":"1","key":"64_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012). \n                    https:\/\/dx.doi.org\/10.1561\/2200000024","journal-title":"Found. Trends Mach. Learn."},{"key":"64_CR6","unstructured":"Computational Optimization Research at Lehigh Laboratory (CORAL): MIP instances. \n                    https:\/\/coral.ise.lehigh.edu\/data-sets\/mixed-integer-instances\/"},{"issue":"1","key":"64_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"JJ Forrest","year":"1992","unstructured":"Forrest, J.J., Goldfarb, D.: Steepest-edge simplex algorithms for linear programming. Math. Program. 57(1), 341\u2013374 (1992). \n                    https:\/\/dx.doi.org\/10.1007\/BF01581089","journal-title":"Math. Program."},{"key":"64_CR8","unstructured":"Gleixner, A., et al.: The SCIP Optimization Suite 5.0, Tech. Rep. 17\u201361, ZIB, Takustr. 7, 14195 Berlin (2017)"},{"issue":"1","key":"64_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"PMJ Harris","year":"1973","unstructured":"Harris, P.M.J.: Pivot selection methods of the devex lp code. Math. Program. 5(1), 1\u201328 (1973). \n                    https:\/\/dx.doi.org\/10.1007\/BF01580108","journal-title":"Math. Program."},{"key":"64_CR10","unstructured":"MIPLIB \u2013 the Mixed Integer Programming LIBrary. \n                    miplib.zib.de"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-59776-8_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"J Witzig","year":"2017","unstructured":"Witzig, J., Berthold, T., Heinz, S.: Experiments with conflict analysis in mixed integer programming. In: Salvagnin, D., Lombardi, M. (eds.) Integration of AI and OR Techniques in Constraint Programming, pp. 211\u2013220. Springer, Cham (2017). \n                    https:\/\/dx.doi.org\/10.1007\/978-3-319-59776-8_17"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18500-8_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T01:34:16Z","timestamp":1567128856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18500-8_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184995","9783030185008"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18500-8_64","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}