{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T22:40:19Z","timestamp":1770676819589,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T00:00:00Z","timestamp":1620345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T00:00:00Z","timestamp":1620345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10898-021-01027-w","type":"journal-article","created":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T02:02:38Z","timestamp":1620352958000},"page":"861-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Branch-and-price for a class of nonconvex mixed-integer nonlinear programs"],"prefix":"10.1007","volume":"81","author":[{"given":"Andrew","family":"Allman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8862-4675","authenticated-orcid":false,"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,7]]},"reference":[{"issue":"6","key":"1027_CR1","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005). https:\/\/doi.org\/10.1287\/opre.1050.0234","journal-title":"Oper. Res."},{"issue":"5","key":"1027_CR2","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1287\/opre.1080.0678","volume":"57","author":"KJ Singh","year":"2009","unstructured":"Singh, K.J., Philpott, A.B., Wood, R.K.: Dantzig\u2013Wolfe decomposition for solving multistage stochastic capacity-planning problems. Oper. Res. 57(5), 1271\u20131286 (2009). https:\/\/doi.org\/10.1287\/opre.1080.0678","journal-title":"Oper. Res."},{"issue":"2","key":"1027_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10898-018-0633-2","volume":"72","author":"I Nowak","year":"2018","unstructured":"Nowak, I., Breitfeld, N., Hendrix, E.M., Njacheun-Njanzoua, G.: Decomposition-based inner- and outer-refinement algorithms for global optimization. J. Glob. Optim. 72(2), 305\u2013321 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0633-2","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1027_CR4","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. Oper. Res. 2(4), 393\u2013410 (1954)","journal-title":"Oper. Res."},{"issue":"5","key":"1027_CR5","doi-asserted-by":"publisher","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. Bull. Am. Math. Soc. 64(5), 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"1027_CR6","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G.L., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L.A.: 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art. Springer (2009)","DOI":"10.1007\/978-3-540-68279-0"},{"issue":"2","key":"1027_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1021\/i260070a031","volume":"18","author":"IE Grossmann","year":"1979","unstructured":"Grossmann, I.E., Sargent, R.W.: Optimum design of multipurpose chemical plants. Ind. Eng. Chem. Process Des. Dev. 18(2), 343\u2013348 (1979). https:\/\/doi.org\/10.1021\/i260070a031","journal-title":"Ind. Eng. Chem. Process Des. Dev."},{"issue":"12","key":"1027_CR8","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta, O.K., Ravindran, A.: Branch and bound experiments in convex nonlinear integer programming author. Manag. Sci. 31(12), 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"issue":"3","key":"1027_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Progr., Ser. B 86(3), 515\u2013532 (1999). https:\/\/doi.org\/10.1007\/s101070050103","journal-title":"Math. Progr., Ser. B"},{"issue":"4","key":"1027_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1097\/ACI.0000000000000254","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972). https:\/\/doi.org\/10.1097\/ACI.0000000000000254","journal-title":"J. Optim. Theory Appl."},{"key":"1027_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Progr. 36, 307\u2013339 (1986). https:\/\/doi.org\/10.1007\/BF02592064","journal-title":"Math. Progr."},{"key":"1027_CR12","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Math. Progr. 66, 327\u2013349 (1994)","journal-title":"Math. Progr."},{"issue":"10\u201311","key":"1027_CR13","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada, I., Grossmann, I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992). https:\/\/doi.org\/10.1016\/0098-1354(92)80028-8","journal-title":"Comput. Chem. Eng."},{"issue":"Suppl. 1","key":"1027_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19(Suppl. 1), 131\u2013136 (1995). https:\/\/doi.org\/10.1016\/0098-1354(95)87027-X","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1027_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10898-015-0322-3","volume":"64","author":"J Kronqvist","year":"2016","unstructured":"Kronqvist, J., Lundell, A., Westerlund, T.: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming. J. Glob. Optim. 64(2), 249\u2013272 (2016). https:\/\/doi.org\/10.1007\/s10898-015-0322-3","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1027_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"I Grossmann","year":"2002","unstructured":"Grossmann, I.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3(3), 227\u2013252 (2002). https:\/\/doi.org\/10.1023\/A:1021039126272","journal-title":"Optim. Eng."},{"key":"1027_CR17","doi-asserted-by":"publisher","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex mixed integer nonlinear programs. In: Mixed Integer Nonlinear Programming, pp. 1\u201339. Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1927-3","DOI":"10.1007\/978-1-4614-1927-3"},{"key":"1027_CR18","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Bernal, D.E., Lundell, A., Grossmann, I.E.: A Review and Comparison of Solvers for Convex MINLP, vol. 20. Springer (2019). https:\/\/doi.org\/10.1007\/s11081-018-9411-8","DOI":"10.1007\/s11081-018-9411-8"},{"issue":"1","key":"1027_CR19","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. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Progr."},{"issue":"2","key":"1027_CR20","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). https:\/\/doi.org\/10.1007\/bf00138689","journal-title":"J. Glob. Optim."},{"key":"1027_CR21","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"591","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. 591, 563\u2013591 (2004)","journal-title":"Math. Progr."},{"issue":"4","key":"1027_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: $$\\alpha $$BB: A global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995). https:\/\/doi.org\/10.1007\/BF01099647","journal-title":"J. Glob. Optim."},{"issue":"9","key":"1027_CR23","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)","journal-title":"AIChE J."},{"issue":"3","key":"1027_CR24","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"MR K\u0131l\u0131n\u00e7","year":"2018","unstructured":"K\u0131l\u0131n\u00e7, M.R., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON. Optim. Methods Softw. 33(3), 540\u2013562 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1350178","journal-title":"Optim. Methods Softw."},{"issue":"4\u20135","key":"1027_CR25","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 tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24(4\u20135), 597\u2013634 (2009). https:\/\/doi.org\/10.1080\/10556780903087124","journal-title":"Optim. Methods Softw."},{"issue":"4\u20135","key":"1027_CR26","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009). https:\/\/doi.org\/10.1080\/10556780902753221","journal-title":"Optim. Methods Softw."},{"key":"1027_CR27","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10898-014-0166-2","DOI":"10.1007\/s10898-014-0166-2"},{"issue":"3","key":"1027_CR28","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1335312","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1027_CR29","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.sorms.2012.08.001","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012). https:\/\/doi.org\/10.1016\/j.sorms.2012.08.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"3","key":"1027_CR30","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization. CDFO. Eur. J. Oper. Res. 252(3), 701\u2013727 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.12.018","journal-title":"CDFO. Eur. J. Oper. Res."},{"issue":"2","key":"1027_CR31","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579036","volume":"11","author":"M Guignard","year":"2003","unstructured":"Guignard, M.: Lagrangean relaxation. Top 11(2), 151\u2013200 (2003). https:\/\/doi.org\/10.1007\/BF02579036","journal-title":"Top"},{"issue":"4","key":"1027_CR32","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10287-010-0125-4","volume":"8","author":"JP Watson","year":"2011","unstructured":"Watson, J.P., Woodruff, D.L.: Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems. Comput. Manag. Sci. 8(4), 355\u2013370 (2011). https:\/\/doi.org\/10.1007\/s10287-010-0125-4","journal-title":"Comput. Manag. Sci."},{"key":"1027_CR33","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.compchemeng.2015.12.017","volume":"87","author":"I Lotero","year":"2016","unstructured":"Lotero, I., Trespalacios, F., Grossmann, I.E., Papageorgiou, D.J., Cheon, M.S.: An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem. Comput. Chem. Eng. 87, 13\u201335 (2016). https:\/\/doi.org\/10.1016\/j.compchemeng.2015.12.017","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1027_CR34","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s10898-018-0621-6","volume":"71","author":"CL Lara","year":"2018","unstructured":"Lara, C.L., Trespalacios, F., Grossmann, I.E.: Global optimization algorithm for capacitated multi-facility continuous location-allocation problems. J. Glob. Optim. 71(4), 871\u2013889 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0621-6","journal-title":"J. Glob. Optim."},{"key":"1027_CR35","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.compchemeng.2019.05.041","volume":"128","author":"C Elsido","year":"2019","unstructured":"Elsido, C., Martelli, E., Grossmann, I.E.: A bilevel decomposition method for the simultaneous heat integration and synthesis of steam\/organic Rankine cycles. Comput. Chem. Eng. 128, 228\u2013245 (2019). https:\/\/doi.org\/10.1016\/j.compchemeng.2019.05.041","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1027_CR36","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10957-011-9888-1","volume":"151","author":"X Li","year":"2011","unstructured":"Li, X., Tomasgard, A., Barton, P.I.: Nonconvex generalized benders decomposition for stochastic separable mixed-integer nonlinear programs. J. Optim. Theory Appl. 151(3), 425\u2013454 (2011). https:\/\/doi.org\/10.1007\/s10957-011-9888-1","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1027_CR37","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10898-019-00769-y","volume":"75","author":"Y Cao","year":"2019","unstructured":"Cao, Y., Zavala, V.M.: A scalable global optimization algorithm for stochastic nonlinear programs. J. Glob. Optim. 75(2), 393\u2013416 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00769-y","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1027_CR38","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10898-019-00816-8","volume":"75","author":"C Li","year":"2019","unstructured":"Li, C., Grossmann, I.E.: A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables. J. Glob. Optim. 75(2), 247\u2013272 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00816-8","journal-title":"J. Glob. Optim."},{"issue":"2\u20133","key":"1027_CR39","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10898-007-9271-9","volume":"43","author":"S Rebennack","year":"2009","unstructured":"Rebennack, S., Kallrath, J., Pardalos, P.M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Glob. Optim. 43(2\u20133), 277\u2013297 (2009). https:\/\/doi.org\/10.1007\/s10898-007-9271-9","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1027_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"issue":"4","key":"1027_CR41","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J Desrosiers","year":"1984","unstructured":"Desrosiers, J., Soumis, F., Desrochers, M.: Routing with time windows by column generation. Networks 14(4), 545\u2013565 (1984). https:\/\/doi.org\/10.1002\/net.3230140406","journal-title":"Networks"},{"issue":"2","key":"1027_CR42","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"1027_CR43","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In: Essays and Surveys in Metaheuristics, pp. 309\u2013324. Springer (2002)","DOI":"10.1007\/978-1-4615-1507-4_14"},{"issue":"1","key":"1027_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23(1), 1\u201313 (1989). https:\/\/doi.org\/10.1287\/trsc.23.1.1","journal-title":"Transp. Sci."},{"issue":"3","key":"1027_CR45","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/trsc.1090.0306","volume":"32","author":"M Stojkovi\u0107","year":"1998","unstructured":"Stojkovi\u0107, M., Soumis, F., Desrosiers, J.: The operational airline crew scheduling problem. Transp. Sci. 32(3), 232\u2013245 (1998). https:\/\/doi.org\/10.1287\/trsc.1090.0306","journal-title":"Transp. Sci."},{"issue":"1","key":"1027_CR46","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","volume":"119","author":"I Ioachim","year":"1999","unstructured":"Ioachim, I., Desrosiers, J., Soumis, F., B\u00e9langer, N.: Fleet assignment and routing with schedule synchronization constraints. Eur. J. Oper. Res. 119(1), 75\u201390 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00343-9","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1027_CR47","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1016\/j.ejor.2004.04.051","volume":"175","author":"N B\u00e9langer","year":"2006","unstructured":"B\u00e9langer, N., Desaulniers, G., Soumis, F., Desrosiers, J.: Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. Eur. J. Oper. Res. 175(3), 1754\u20131766 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2004.04.051","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1027_CR48","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998). https:\/\/doi.org\/10.1287\/opre.46.3.316","journal-title":"Oper. Res."},{"issue":"1","key":"1027_CR49","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.48.1.111.12453","volume":"48","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck, F.: On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48(1), 111\u2013128 (2000). https:\/\/doi.org\/10.1287\/opre.48.1.111.12453","journal-title":"Oper. Res."},{"key":"1027_CR50","unstructured":"Wolsey, L.A.: Integer Programming. Wiley (1998)"},{"key":"1027_CR51","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.2014.0623","volume":"27","author":"M Lubin","year":"2015","unstructured":"Lubin, M., Dunning, I.: Computing in operations research using Julia. INFORMS J. Comput. 27, 237\u2013248 (2015)","journal-title":"INFORMS J. Comput."},{"key":"1027_CR52","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1961","unstructured":"Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting-stock problem. Oper. Res. 9, 849\u2013859 (1961)","journal-title":"Oper. Res."},{"issue":"2","key":"1027_CR53","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(00)00254-X","volume":"134","author":"S Rajagopalan","year":"2001","unstructured":"Rajagopalan, S., Yu, H.L.: Capacity planning with congestion effects. Eur. J. Oper. Res. 134(2), 365\u2013377 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00254-X","journal-title":"Eur. J. Oper. Res."},{"key":"1027_CR54","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.compchemeng.2007.03.007","volume":"32","author":"R Karuppiah","year":"2008","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization of multiscenario mixed integer nonlinear programming models arising in the synthesis of integrated water networks under uncertainty. Comput. Chem. Eng. 32, 145\u2013160 (2008). https:\/\/doi.org\/10.1016\/j.compchemeng.2007.03.007","journal-title":"Comput. Chem. Eng."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01027-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01027-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01027-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T05:06:14Z","timestamp":1636520774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01027-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,7]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["1027"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01027-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,7]]},"assertion":[{"value":"6 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}