{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T19:56:14Z","timestamp":1790884574062,"version":"4.1.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10898-016-0450-4","type":"journal-article","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T01:29:44Z","timestamp":1466126984000},"page":"731-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":81,"title":["Three enhancements for optimization-based bound tightening"],"prefix":"10.1007","volume":"67","author":[{"given":"Ambros M.","family":"Gleixner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,6,17]]},"reference":[{"key":"450_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007). URN:nbn:de:kobv:83-opus-16117"},{"key":"450_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Berlin (2013). doi: 10.1007\/978-3-642-38189-8_18"},{"issue":"9","key":"450_CR3","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha $$ \u03b1 BB, for general twice-differentiable constrained NLPs\u2013II. Implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998). doi: 10.1016\/S0098-1354(98)00218-X","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"450_CR4","doi-asserted-by":"publisher","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"CS Adjiman","year":"2000","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE J. 46(9), 1769\u20131797 (2000). doi: 10.1002\/aic.690460908","journal-title":"AIChE J."},{"key":"450_CR5","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: Finding cuts in the TSP (A preliminary report). Technical report 95-05, Center for Discrete Mathematics & Theoretical Computer Science (DIMACS) (1995)"},{"key":"450_CR6","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2007)"},{"issue":"3","key":"450_CR7","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s10898-012-9848-9","volume":"56","author":"P Belotti","year":"2013","unstructured":"Belotti, P.: Bound reduction using pairs of linear inequalities. J. Glob. Optim. 56(3), 787\u2013819 (2013). doi: 10.1007\/s10898-012-9848-9","journal-title":"J. Glob. Optim."},{"key":"450_CR8","doi-asserted-by":"publisher","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: Feasibility-based bounds tightening via fixed points. In: W.\u00a0Wu, O.\u00a0Daescu (eds.) Combinatorial Optimization and Applications, Lecture Notes in Computer Science, vol. 6508, pp. 65\u201376. Springer, Berlin (2010). doi: 10.1007\/978-3-642-17458-2_7","DOI":"10.1007\/978-3-642-17458-2_7"},{"key":"450_CR9","unstructured":"Belotti, P., Cafieri, S., Lee, J., Liberti, L.: On feasibility based bounds tightening. Technical report 3325, Optimization Online (2012). http:\/\/www.optimization-online.org\/DB_HTML\/2012\/01\/3325.html"},{"key":"450_CR10","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009). doi: 10.1080\/10556780903087124","journal-title":"Optim. Methods Softw."},{"key":"450_CR11","unstructured":"Berthold, T.: Heuristic algorithms in global MINLP solvers. Ph.D. thesis, Technische Universit\u00e4t Berlin (2014)"},{"issue":"1","key":"450_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"RE Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002). doi: 10.1287\/opre.50.1.3.17780","journal-title":"Oper. Res."},{"issue":"3","key":"450_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02592196","volume":"74","author":"A Caprara","year":"1996","unstructured":"Caprara, A., Fischetti, M.: $$\\{0, \\tfrac{1}{2}\\}$$ { 0 , 1 2 } -Chv\u00e1tal-Gomory cuts. Math. Progr. 74(3), 221\u2013235 (1996). doi: 10.1007\/BF02592196","journal-title":"Math. Progr."},{"key":"450_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A Caprara","year":"2010","unstructured":"Caprara, A., Locatelli, M.: Global optimization problems and domain reduction strategies. Math. Progr. 125, 123\u2013137 (2010). doi: 10.1007\/s10107-008-0263-4","journal-title":"Math. Progr."},{"issue":"4","key":"450_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(4), 305\u2013337 (1973). doi: 10.1016\/0012-365X(73)90167-2","journal-title":"Discrete Math."},{"key":"450_CR16","unstructured":"CMU-IBM Cyber-Infrastructure for MINLP. http:\/\/www.minlp.org\/"},{"key":"450_CR17","unstructured":"COIN-OR: Couenne, an exact solver for nonconvex MINLPs. http:\/\/www.coin-or.org\/Couenne"},{"key":"450_CR18","unstructured":"COIN-OR: CppAD, a package for differentiation of CppAD \u00a0algorithms. http:\/\/www.coin-or.org\/CppAD"},{"key":"450_CR19","unstructured":"COIN-OR: Ipopt, Interior point optimizer. http:\/\/www.coin-or.org\/Ipopt"},{"key":"450_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2, 393\u2013410 (1954). doi: 10.1287\/opre.2.4.393","journal-title":"Oper. Res."},{"issue":"2","key":"450_CR21","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Progr. 91(2), 201\u2013213 (2002). doi: 10.1007\/s101070100263","journal-title":"Math. Progr."},{"key":"450_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0927-0507(05)12002-7","volume-title":"Discrete Optimization, Handbooks in Operations Research and Management Science","author":"A F\u00fcgenschuh","year":"2005","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization, Handbooks in Operations Research and Management Science, vol. 12, pp. 69\u2013121. Elsevier, Amsterdam (2005). doi: 10.1016\/S0927-0507(05)12002-7"},{"issue":"4","key":"450_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","volume":"7","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Math. Progr. Comput. 7(4), 367\u2013398 (2015). doi: 10.1007\/s12532-015-0083-5","journal-title":"Math. Progr. Comput."},{"key":"450_CR24","unstructured":"Gleixner, A., Vigerske, S.: Analyzing the computational impact of individual MINLP solver components. Talk at MINLP 2014, Carnegie Mellon University, Pittsburgh, PA, USA (2014). http:\/\/minlp.cheme.cmu.edu\/2014\/papers\/gleixner.pdf"},{"key":"450_CR25","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society 64, 275\u2013278 (1958)","journal-title":"Bulletin of the American Society"},{"key":"450_CR26","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical report P-1885, The RAND Corporation (1960)"},{"key":"450_CR27","unstructured":"Grossmann, I.E., Sahinidis, N.V. (eds.): Special issue on mixed integer programming and its application to engineering, part I. Optim. Eng. 4(1\u20132) (2002). http:\/\/link.springer.com\/journal\/11081\/4\/1\/page\/1"},{"key":"450_CR28","unstructured":"Hendel, G.: Empirical analysis of solving phases in mixed integer programming. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2014). URN:nbn:de:0297-zib-54270"},{"key":"450_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)"},{"key":"450_CR30","unstructured":"Huang, W.: Operative planning of water supply networks by mixed integer nonlinear programming. Master\u2019s thesis, Freie Universit\u00e4t Berlin (2011)"},{"issue":"2","key":"450_CR31","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.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. Progr. Comput. 3(2), 103\u2013163 (2011). doi: 10.1007\/s12532-011-0025-9","journal-title":"Math. Progr. Comput."},{"key":"450_CR32","unstructured":"LaGO\u2014Lagrangian Global Optimizer. https:\/\/projects.coin-or.org\/LaGO"},{"key":"450_CR33","unstructured":"Lodi, A., Nogales-G\u00f3mez, A., Belotti, P., Fischetti, M., Monaci, M., Salvagnin, D., Bonami, P.: Indicator constraints in mixed-integer programming. Talk at SCIP Workshop 2014, Zuse Institute Berlin, Germany (2014). http:\/\/scip.zib.de\/workshop\/scip_lodi.pdf"},{"issue":"4","key":"450_CR34","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Computers & Chemical Engineering 21(4), 351\u2013369 (1997). doi: 10.1016\/S0098-1354(96)00282-7","journal-title":"Computers & Chemical Engineering"},{"issue":"3","key":"450_CR35","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3), 363\u2013371 (2001). doi: 10.1287\/opre.49.3.363.11211","journal-title":"Oper. Res."},{"issue":"1","key":"450_CR36","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Progr. B 10(1), 147\u2013175 (1976). doi: 10.1007\/BF01580665","journal-title":"Math. Progr. B"},{"key":"450_CR37","unstructured":"MINLP library 2. http:\/\/gamsworld.org\/minlp\/minlplib2"},{"issue":"1","key":"450_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-012-0555-6","volume":"136","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Progr. 136(1), 155\u2013182 (2012). doi: 10.1007\/s10107-012-0555-6","journal-title":"Math. Progr."},{"key":"450_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57, 3\u201350 (2013). doi: 10.1007\/s10898-012-9874-7","journal-title":"J. Glob. Optim."},{"issue":"2\u20133","key":"450_CR40","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2\u20133), 503\u2013526 (2014). doi: 10.1007\/s10898-014-0166-2","journal-title":"J. Glob. Optim."},{"key":"450_CR41","doi-asserted-by":"publisher","unstructured":"Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., W\u00e4chter, A.: A probing algorithm for MINLP with failure prediction by SVM. In: T.\u00a0Achterberg, J.C. Beck (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 6697, pp. 154\u2013169. Springer, Berlin (2011). doi: 10.1007\/978-3-642-21311-3_15","DOI":"10.1007\/978-3-642-21311-3_15"},{"issue":"1\u20133","key":"450_CR42","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Progr. 46(1\u20133), 379\u2013390 (1990). doi: 10.1007\/BF01585752","journal-title":"Math. Progr."},{"key":"450_CR43","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271\u2013369 (2004). doi: 10.1017\/S0962492904000194","journal-title":"Acta Numer."},{"issue":"2","key":"450_CR44","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10100-007-0051-x","volume":"16","author":"I Nowak","year":"2008","unstructured":"Nowak, I., Vigerske, S.: LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Cent. Eur. J. Oper. Res. 16(2), 127\u2013138 (2008). doi: 10.1007\/s10100-007-0051-x","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"6","key":"450_CR45","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957). doi: 10.1002\/j.1538-7305.1957.tb01515.x","journal-title":"Bell Syst. Tech. J."},{"issue":"3","key":"450_CR46","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1021\/ie00015a012","volume":"32","author":"I Quesada","year":"1993","unstructured":"Quesada, I., Grossmann, I.E.: Global optimization algorithm for heat exchanger networks. Ind. Eng. Chem. Res. 32(3), 487\u2013499 (1993). doi: 10.1021\/ie00015a012","journal-title":"Ind. Eng. Chem. Res."},{"key":"450_CR47","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01106605","volume":"6","author":"I Quesada","year":"1995","unstructured":"Quesada, I., Grossmann, I.E.: A global optimization algorithm for linear fractional and bilinear programs. J. Glob. Optim. 6, 39\u201376 (1995). doi: 10.1007\/BF01106605","journal-title":"J. Glob. Optim."},{"issue":"5","key":"450_CR48","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"H Ryoo","year":"1995","unstructured":"Ryoo, H., Sahinidis, N.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551\u2013566 (1995). doi: 10.1016\/0098-1354(94)00097-2","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"450_CR49","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8(2), 107\u2013138 (1996). doi: 10.1007\/BF00138689","journal-title":"J. Glob. Optim."},{"issue":"4","key":"450_CR50","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"MW Savelsbergh","year":"1994","unstructured":"Savelsbergh, M.W.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6(4), 445\u2013454 (1994). doi: 10.1287\/ijoc.6.4.445","journal-title":"ORSA J. Comput."},{"key":"450_CR51","unstructured":"SCIP\u2014solving constraint integer programs. http:\/\/scip.zib.de"},{"key":"450_CR52","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EM Smith","year":"1999","unstructured":"Smith, E.M., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23, 457\u2013478 (1999). doi: 10.1016\/S0098-1354(98)00286-5","journal-title":"Comput. Chem. Eng."},{"key":"450_CR53","unstructured":"SoPlex\u2014the Sequential object-oriented simPlex. http:\/\/soplex.zib.de\/"},{"issue":"2","key":"450_CR54","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). doi: 10.1137\/0201010","journal-title":"SIAM J. Comput."},{"key":"450_CR55","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Progr. 99, 563\u2013591 (2004). doi: 10.1007\/s10107-003-0467-6","journal-title":"Math. Progr."},{"issue":"2","key":"450_CR56","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Progr. 103(2), 225\u2013249 (2005). doi: 10.1007\/s10107-005-0581-8","journal-title":"Math. Progr."},{"key":"450_CR57","unstructured":"Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. Ph.D. thesis, Humboldt-Universit\u00e4t zu Berlin, Mathematisch-Naturwissenschaftliche Fakult\u00e4t II (2013). URN:nbn:de:kobv:11-100208240"},{"issue":"1","key":"450_CR58","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Progr. 106(1), 25\u201357 (2006). doi: 10.1007\/s10107-004-0559-y","journal-title":"Math. Progr."},{"issue":"6","key":"450_CR59","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. Biom. Bull. 1(6), 80\u201383 (1945)","journal-title":"Biom. Bull."},{"key":"450_CR60","doi-asserted-by":"publisher","unstructured":"Williams, H.P.: A reduction procedure for linear and integer programming models. In: Redundancy in Mathematical Programming, Lecture Notes in Economics and Mathematical Systems, vol. 206, pp. 87\u2013107. Springer, Berlin (1983). doi: 10.1007\/978-3-642-45535-3_9","DOI":"10.1007\/978-3-642-45535-3_9"},{"key":"450_CR61","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. thesis, Technische Universit\u00e4t Berlin (1996). URN:nbn:de:0297-zib-5386"},{"key":"450_CR62","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Glob. Optim. 14, 217\u2013249 (1999). doi: 10.1023\/A:1008312714792","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0450-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0450-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0450-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0450-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T07:55:11Z","timestamp":1600761311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0450-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,17]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["450"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0450-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,17]]}}}