{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:28:35Z","timestamp":1768678115902,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T00:00:00Z","timestamp":1561766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T00:00:00Z","timestamp":1561766400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10732-019-09418-9","type":"journal-article","created":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T10:02:22Z","timestamp":1561802542000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Objective scaling ensemble approach for integer linear programming"],"prefix":"10.1007","volume":"26","author":[{"given":"Weili","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles D.","family":"Nicholson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"9418_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4, 77\u201386 (2007)","journal-title":"Discrete Optim."},{"key":"9418_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10898-010-9527-7","volume":"48","author":"L Bai","year":"2010","unstructured":"Bai, L., Hearn, D., Lawphongpanich, S.: A heuristic method for the minimum toll booth problem. J. Glob. Optim. 48, 533\u2013548 (2010)","journal-title":"J. Glob. Optim."},{"key":"9418_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"E Balas","year":"2001","unstructured":"Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: Octane: a new heuristic for pure 0\u20131 programs. Oper. Res. 49, 207\u2013225 (2001)","journal-title":"Oper. Res."},{"key":"9418_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E Balas","year":"1980","unstructured":"Balas, E., Martin, C.: Pivot and complement-a heuristic for 0\u20131 programming. Manag. Sci. 26, 86\u201396 (1980)","journal-title":"Manag. Sci."},{"key":"9418_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"E Balas","year":"2004","unstructured":"Balas, E., Schmieta, S., Wallace, C.: Pivot and shift-a mixed integer programming heuristic. Discrete Optim. 1, 3\u201312 (2004)","journal-title":"Discrete Optim."},{"key":"9418_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10288-006-0006-4","volume":"5","author":"J Beli\u00ebn","year":"2007","unstructured":"Beli\u00ebn, J.: Exact and heuristic methodologies for scheduling in hospitals: problems, formulations and algorithms. 4OR 5, 157\u2013160 (2007)","journal-title":"4OR"},{"key":"9418_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49\u201371 (2003)","journal-title":"Math. Program."},{"key":"9418_CR8","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1016\/j.cor.2009.12.008","volume":"37","author":"A Bley","year":"2010","unstructured":"Bley, A., Boland, N., Fricke, C., Froyland, G.: A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. 37, 1641\u20131647 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9418_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. (CSUR) 35, 268\u2013308 (2003)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"9418_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cornu\u00e9jols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"9418_CR11","first-page":"123","volume":"26","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 26, 123\u2013140 (1996)","journal-title":"Mach. Learn."},{"key":"9418_CR12","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.artint.2006.02.005","volume":"170","author":"Sharlee Climer","year":"2006","unstructured":"Climer, Sharlee, Zhang, Weixiong: Cut-and-solve: an iterative search strategy for combinatorial optimization problems. Artif. Intell. 170, 714\u2013738 (2006)","journal-title":"Artif. Intell."},{"key":"9418_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/ijoc.12.3.223.12638","volume":"12","author":"T Crainic","year":"2000","unstructured":"Crainic, T., Gendreau, M., Fravolden, J.: A simplex-based tabu search method for capacitated network design. INFORMS J. Comput. 12, 223\u2013236 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9418_CR14","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"T Crainic","year":"2004","unstructured":"Crainic, T., Gendron, B., Hernu, G.: A slope scaling\/Lagrangian perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10, 525\u2013545 (2004)","journal-title":"J. Heuristics"},{"key":"9418_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve mip solutions. Math. Program. 102, 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"9418_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9418_CR17","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10732-007-9021-7","volume":"13","author":"J Eckstein","year":"2007","unstructured":"Eckstein, J., Nediak, M.: Pivot, cut, and dive: a heuristic for 0\u20131 mixed integer programming. J. Heuristics 13, 471\u2013503 (2007)","journal-title":"J. Heuristics"},{"key":"9418_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104, 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"9418_CR19","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"9418_CR20","doi-asserted-by":"publisher","unstructured":"Gendreau, M., Potvin, J.-Y. (eds.): Handbook of Metaheuristics, 2nd ed. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"9418_CR21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1026102724889","volume":"122","author":"B Gendron","year":"2003","unstructured":"Gendron, B., Potvin, J.-Y., Soriano, P.: A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Ann. Oper. Res. 122, 193\u2013217 (2003)","journal-title":"Ann. Oper. Res."},{"key":"9418_CR22","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Springer (1999)","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"9418_CR23","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.cie.2011.05.012","volume":"61","author":"D Gulczynski","year":"2011","unstructured":"Gulczynski, D., Golden, B., Wasil, E.: The multi-depot split delivery vehicle routing problem: an integer programming-based heuristic, new test problems, and computational results. Comput. Ind. Eng. 61, 794\u2013804 (2011)","journal-title":"Comput. Ind. Eng."},{"key":"9418_CR24","unstructured":"Gurobi\u00a0Optimization, Inc. (2012) Gurobi solves the hardest models. http:\/\/www.gurobi.com\/company\/news\/gurobi-solves-the-previously-unsolvable . Accessed 20 Nov 2015"},{"key":"9418_CR25","unstructured":"Gurobi\u00a0Optimization, Inc. (2014) Features and benefits overview. http:\/\/www.gurobi.com\/products\/gurobi-optimizer\/features-and-benefits . Accessed 31 Dec 2014"},{"key":"9418_CR26","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"KL Hoffman","year":"1993","unstructured":"Hoffman, K.L., Padberg, M.: Solving airline crew scheduling problems by branch-and-cut. Manag. Sci. 39, 657\u2013682 (1993)","journal-title":"Manag. Sci."},{"key":"9418_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9418_CR28","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","volume":"35","author":"D Kim","year":"2000","unstructured":"Kim, D., Pardalos, P.: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems. Networks 35, 216\u2013222 (2000)","journal-title":"Networks"},{"key":"9418_CR29","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"9418_CR30","doi-asserted-by":"publisher","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., Danna, E., Gamrath, G., Gleixner, A., Heinz, S., et al.: Miplib 2010. Math. Program. Comput. 3, 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"key":"9418_CR31","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"J Linderoth","year":"2010","unstructured":"Linderoth, J., Lodi, A.: MILP software. In: Cochran, J., Cox, L., Keskinocak, P., Kharoufeh, J., Smith, J. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2010)"},{"key":"9418_CR32","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Berlin (2010)"},{"key":"9418_CR33","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10589-007-9060-x","volume":"39","author":"A Nahapetyan","year":"2008","unstructured":"Nahapetyan, A., Pardalos, P.: Adaptive dynamic cost updating procedure for solving fixed charge network flow problems. Comput. Optim. Appl. 39, 37\u201350 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9418_CR34","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization, vol. 18. Wiley, New York (1988)"},{"key":"9418_CR35","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cie.2016.07.030","volume":"99","author":"C Nicholson","year":"2016","unstructured":"Nicholson, C., Zhang, W.: Optimal network flow: a predictive analytics perspective on the fixed-charge network flow problem. Comput. Ind. Eng. 99, 260\u2013268 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"9418_CR36","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-006-0009-0","volume":"110","author":"J Patel","year":"2007","unstructured":"Patel, J., Chinneck, J.: Active-constraint variable ordering for faster feasibility of mixed integer linear programs. Math. Program. 110, 445\u2013474 (2007)","journal-title":"Math. Program."},{"key":"9418_CR37","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C Raack","year":"2011","unstructured":"Raack, C., Koster, A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57, 141\u2013156 (2011)","journal-title":"Networks"},{"key":"9418_CR38","first-page":"133","volume":"2","author":"T Shiina","year":"2012","unstructured":"Shiina, T., Xu, C.: Dynamic slope scaling procedure to solve stochastic integer programming problem. J. Comput. Model. 2, 133\u2013148 (2012)","journal-title":"J. Comput. Model."},{"key":"9418_CR39","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J van den Akker","year":"2000","unstructured":"van den Akker, J., Hurkens, C., Savelsbergh, M.: Time-indexed formulations for machine scheduling problems: column generation. INFORMS J. Comput. 12, 111\u2013124 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9418_CR40","doi-asserted-by":"publisher","first-page":"04018015","DOI":"10.1061\/(ASCE)ST.1943-541X.0001984","volume":"144","author":"W Zhang","year":"2018","unstructured":"Zhang, W., Lin, Pi, Wang, N., Nicholson, C., Xue, X.: Probabilistic prediction of postdisaster functionality loss of community building portfolios considering utility disruptions. J. Struct. Eng. 144, 04018015 (2018)","journal-title":"J. Struct. Eng."},{"key":"9418_CR41","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/23789689.2016.1254995","volume":"1","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Nicholson, C.: A multi-objective optimization model for retrofit strategies to mitigate direct economic loss and population dislocation. Sustain. Resilient Infrastruct. 1, 123\u2013136 (2016a)","journal-title":"Sustain. Resilient Infrastruct."},{"key":"9418_CR42","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.cie.2016.07.014","volume":"99","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Nicholson, C.: Prediction-based relaxation solution approach for the fixed charge network flow problem. Comput. Ind. Eng. 99, 106\u2013111 (2016b)","journal-title":"Comput. Ind. Eng."},{"key":"9418_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.strusafe.2016.06.003","volume":"62","author":"W Zhang","year":"2016","unstructured":"Zhang, W., Wang, N.: Resilience-based risk mitigation for road networks. Struct. Saf. 62, 57\u201365 (2016)","journal-title":"Struct. Saf."},{"key":"9418_CR44","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.strusafe.2017.05.001","volume":"67","author":"W Zhang","year":"2017","unstructured":"Zhang, W., Wang, N.: Bridge network maintenance prioritization under budget constraint. Struct. Saf. 67, 96\u2013104 (2017)","journal-title":"Struct. Saf."},{"key":"9418_CR45","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1080\/15732479.2016.1271813","volume":"13","author":"W Zhang","year":"2017","unstructured":"Zhang, W., Wang, N., Nicholson, C.: Resilience-based post-disaster recovery strategies for road-bridge networks. Struct. Infrastruct. Eng. 13, 1404\u20131413 (2017)","journal-title":"Struct. Infrastruct. Eng."},{"key":"9418_CR46","doi-asserted-by":"crossref","unstructured":"Zhang, W., Yao, Z.: A reformed lattice gas model and its application in the simulation of evacuation in hospital fire. In: Industrial Engineering and Engineering Management (IEEM), 2010 IEEE International Conference on. IEEE, pp. 1543\u20131547 (2010)","DOI":"10.1109\/IEEM.2010.5674167"},{"key":"9418_CR47","first-page":"045","volume":"1","author":"W Zhang","year":"2010","unstructured":"Zhang, W., Zhao, L.: Lattice gas model for simulating pedestrian evacuation in the dormitory fire. J. Saf. Environ. 1, 045 (2010)","journal-title":"J. Saf. Environ."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09418-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-019-09418-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-019-09418-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T21:30:36Z","timestamp":1694986236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-019-09418-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,29]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9418"],"URL":"https:\/\/doi.org\/10.1007\/s10732-019-09418-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,29]]},"assertion":[{"value":"11 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}