{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T04:44:27Z","timestamp":1772081067047,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["ARC DP140100985"],"award-info":[{"award-number":["ARC DP140100985"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1253-9","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T08:23:14Z","timestamp":1519892594000},"page":"503-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems"],"prefix":"10.1007","volume":"175","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Christiansen","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Dandurand","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Eberhard","sequence":"additional","affiliation":[]},{"given":"Fabricio","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,1]]},"reference":[{"key":"1253_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (2011)"},{"key":"1253_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"N Shor","year":"1985","unstructured":"Shor, N.: Minimization Methods for Non-differentiable Functions. Springer, New York (1985)"},{"key":"1253_CR3","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"1253_CR4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"issue":"1","key":"1253_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C.C., Schultz, R.: Dual decomposition in stochastic integer programming. Oper. Res. Lett. 24(1), 37\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"key":"1253_CR6","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D Bertsekas","year":"1982","unstructured":"Bertsekas, D.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, London (1982)"},{"key":"1253_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"key":"1253_CR8","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization. Academic Press, New York (1969)"},{"issue":"5","key":"1253_CR9","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"1253_CR10","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal, C.: An Extension of Davidon Methods to Non differentiable Problems, pp. 95\u2013109. Springer, Berlin Heidelberg (1975)","DOI":"10.1007\/BFb0120700"},{"key":"1253_CR11","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1590\/0101-7438.2014.034.03.0647","volume":"34","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C.: Bundle methods in the XXIst century: a bird\u2019s-eye view. Pesqui. Oper. 34, 647\u2013670 (2014)","journal-title":"Pesqui. Oper."},{"key":"1253_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9762-4","volume":"63","author":"W Hare","year":"2016","unstructured":"Hare, W., Sagastiz\u00e1bal, C., Solodov, M.: A proximal bundle method for nonsmooth nonconvex functions with inexact information. Comput. Optim. Appl. 63, 1\u201328 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1253_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10107-014-0809-6","volume":"148","author":"W de Oliveira","year":"2014","unstructured":"de Oliveira, W., Sagastiz\u00e1bal, C., Lemar\u00e9chal, C.: Convex proximal bundle methods in depth: a unified analysis for inexact oracles. Math. Program. 148(1), 241\u2013277 (2014)","journal-title":"Math. Program."},{"issue":"6","key":"1253_CR14","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"HB Amor","year":"2009","unstructured":"Amor, H.B., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157(6), 1167\u20131184 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1253_CR15","unstructured":"Bertsekas, D.: Incremental aggregated proximal and augmented Lagrangian algorithms. arXiv preprint \n                    arXiv:1509.09257\n                    \n                   (2015)"},{"issue":"2","key":"1253_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1137\/120865987","volume":"24","author":"F Fischer","year":"2014","unstructured":"Fischer, F., Helmberg, C.: A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions. SIAM J. Optim. 24(2), 795\u2013822 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1253_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.orl.2013.02.003","volume":"41","author":"M Lubin","year":"2013","unstructured":"Lubin, M., Martin, K., Petra, C., Sand\u0131k\u00e7\u0131, B.: On parallelizing dual decomposition in stochastic integer programming. Oper. Res. Lett. 41(3), 252\u2013258 (2013)","journal-title":"Oper. Res. Lett."},{"key":"1253_CR18","volume-title":"Convex Optimization Algorithms","author":"D Bertsekas","year":"2015","unstructured":"Bertsekas, D.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"issue":"1","key":"1253_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"C Holloway","year":"1974","unstructured":"Holloway, C.: An extension of the Frank and Wolfe method of feasible directions. Math. Program. 6(1), 14\u201327 (1974)","journal-title":"Math. Program."},{"issue":"1","key":"1253_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01584323","volume":"13","author":"B Von Hohenbalken","year":"1977","unstructured":"Von Hohenbalken, B.: Simplicial decomposition in nonlinear programming algorithms. Math. Program. 13(1), 49\u201368 (1977)","journal-title":"Math. Program."},{"issue":"4","key":"1253_CR21","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1093\/imanum\/drq024","volume":"31","author":"S Bonettini","year":"2011","unstructured":"Bonettini, S.: Inexact block coordinate descent methods with application to non-negative matrix factorization. IMA J. Numer. Anal. 31(4), 1431\u20131452 (2011)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"1253_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear Gauss\u2013Seidel method under convex constraints. Oper. Res. Lett. 26(3), 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"key":"1253_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Nav. Res. Logist. Q. 4, 79\u201385 (1957). 361","journal-title":"Nav. Res. Logist. Q."},{"key":"1253_CR24","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"1253_CR25","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1137\/0111043","volume":"11","author":"J Warga","year":"1963","unstructured":"Warga, J.: Minimizing certain convex functions. SIAM J. Appl. Math. 11, 588\u2013593 (1963)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"1253_CR26","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10107-003-0374-x","volume":"96","author":"J Eckstein","year":"2003","unstructured":"Eckstein, J.: A practical general approximation criterion for methods of multipliers based on Bregman distances. Math. Program. 96(1), 61\u201386 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1253_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.: A practical relative error criterion for augmented lagrangians. Math. Program. 141(1), 319\u2013348 (2013)","journal-title":"Math. Program."},{"key":"1253_CR28","doi-asserted-by":"crossref","unstructured":"Hamdi, A., Mahey, P., Dussault, J.P.: Recent Advances in Optimization: Proceedings of the 8th French\u2013German Conference on Optimization Trier, July 21\u201326, 1996, chap. A New Decomposition Method in Nonconvex Programming via a Separable Augmented Lagrangian, pp. 90\u2013104. Springer Berlin Heidelberg, Berlin, Heidelberg (1997)","DOI":"10.1007\/978-3-642-59073-3_7"},{"issue":"1","key":"1253_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1253_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"1253_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur l\u2019approximation, par elements finis d\u2019ordre un, et la resolution, par penalisation-dualit\u00e9, d\u2019une classe de problems de dirichlet non lineares. Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationelle 9, 41\u201376 (1975)","journal-title":"Revue Fran\u00e7aise d\u2019Automatique, Informatique, et Recherche Op\u00e9rationelle"},{"issue":"1","key":"1253_CR32","first-page":"405","volume":"152","author":"N Chatzipanagiotis","year":"2014","unstructured":"Chatzipanagiotis, N., Dentcheva, D., Zavlanos, M.: An augmented Lagrangian method for distributed optimization. Math. Program. 152(1), 405\u2013434 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"1253_CR33","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1080\/10556788.2014.966824","volume":"30","author":"R Tappenden","year":"2015","unstructured":"Tappenden, R., Richt\u00e1rik, P., B\u00fcke, B.: Separable approximations and decomposition methods for the augmented Lagrangian. Optim. Methods Softw. 30(3), 643\u2013668 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1253_CR34","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6377(92)90046-6","volume":"12","author":"J Mulvey","year":"1992","unstructured":"Mulvey, J., Ruszczy\u0144ski, A.: A diagonal quadratic approximation method for large scale linear programs. Oper. Res. Lett. 12(4), 205\u2013215 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1253_CR35","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1287\/moor.20.3.634","volume":"20","author":"A Ruszczy\u0144ski","year":"1995","unstructured":"Ruszczy\u0144ski, A.: On convergence of an augmented Lagrangian decomposition method for sparse convex optimization. Math. Oper. Res. 20(3), 634\u2013656 (1995)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1253_CR36","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1137\/S1052623495288064","volume":"9","author":"K Kiwiel","year":"1999","unstructured":"Kiwiel, K., Rosa, C., Ruszczy\u0144ski, A.: Proximal decomposition via alternating linearization. SIAM J. Optim. 9(3), 668\u2013689 (1999)","journal-title":"SIAM J. Optim."},{"key":"1253_CR37","first-page":"3447","volume":"15","author":"X Lin","year":"2014","unstructured":"Lin, X., Pham, M., Ruszczy\u0144ski, A.: Alternating linearization for structured regularization problems. J. Mach. Learn. Res. 15, 3447\u20133481 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1253_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64, 81\u2013101 (1994)","journal-title":"Math. Program."},{"key":"1253_CR39","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"B He","year":"2002","unstructured":"He, B., Liao, L.Z., Han, D., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92, 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"1253_CR40","unstructured":"Boland, N., Christiansen, J., Dandurand, B., Eberhard, A., Linderoth, J., Luedtke, J., Oliveira, F.: Progressive hedging with a Frank\u2013Wolfe based method for computing stochastic mixed-integer programming Lagrangian dual bounds. Optimization Online (2016). \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2016\/03\/5391.html"},{"issue":"1\u20133","key":"1253_CR41","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1\u20133), 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"1253_CR42","volume-title":"Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives","author":"J Eckstein","year":"2014","unstructured":"Eckstein, J., Yao, W.: Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives. Rutgers University, New Brunswick (2014). Tech. rep"},{"issue":"2","key":"1253_CR43","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/0805023","volume":"5","author":"P Mahey","year":"1995","unstructured":"Mahey, P., Oualibouch, S., Tao, P.D.: Proximal decomposition on the graph of a maximal monotone operator. SIAM J. Optim. 5(2), 454\u2013466 (1995)","journal-title":"SIAM J. Optim."},{"key":"1253_CR44","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.ijepes.2015.04.009","volume":"73","author":"MJ Feizollahi","year":"2015","unstructured":"Feizollahi, M.J., Costley, M., Ahmed, S., Grijalva, S.: Large-scale decentralized unit commitment. Int. J. Electr. Power Energy Syst. 73, 97\u2013106 (2015)","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"1","key":"1253_CR45","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-016-1000-z","volume":"157","author":"D Gade","year":"2016","unstructured":"Gade, D., Hackebeil, G., Ryan, S.M., Watson, J.P., Wets, R.J.B., Woodruff, D.L.: Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. Math. Program. 157(1), 47\u201367 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"1253_CR46","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"1253_CR47","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"3","key":"1253_CR48","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF00941400","volume":"71","author":"RJ Hathaway","year":"1991","unstructured":"Hathaway, R.J., Bezdek, J.C.: Grouped coordinate minimization using Newton\u2019s method for inexact minimization in one vector coordinate. J. Optim. Theory Appl. 71(3), 503\u2013516 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1253_CR49","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/BF02191984","volume":"84","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Approximations in proximal bundle methods and decomposition of convex programs. J. Optim. Theory Appl. 84(3), 529\u2013548 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"1253_CR50","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O., Luedtke, J.: Strengthened Benders cuts for stochastic integer programs with continuous recourse (2014). \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2014\/03\/4263.pdf\n                    \n                  . Last Accessed 13 Jan (2015)"},{"key":"1253_CR51","unstructured":"Ahmed, S., Garcia, R., Kong, N., Ntaimo, L., Parija, G., Qiu, F., Sen, S.: SIPLIB: A stochastic integer programming test problem library (2015). \n                    http:\/\/www.isye.gatech.edu\/sahmed\/siplib"},{"key":"1253_CR52","unstructured":"Ntaimo, L.: Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions. Ph.D. thesis (2004)"},{"key":"1253_CR53","unstructured":"The MathWorks, Natick: MATLAB 2012b (2014)"},{"key":"1253_CR54","unstructured":"IBM Corporation: IBM ILOG CPLEX Optimization Studio CPLEX Users Manual. \n                    http:\/\/www.ibm.com\/support\/knowledgecenter\/en\/SSSA5P_12.6.1\/ilog.odms.studio.help\/pdf\/usrcplex.pdf\n                    \n                  . Last Accessed 22 Aug (2016)"},{"key":"1253_CR55","unstructured":"IBM Corporation: IBM ILOG CPLEX V12.5. \n                    http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/\n                    \n                  . Last Accessed 28 Jan (2016)"},{"key":"1253_CR56","unstructured":"COmputational INfrastructure for Operations Research. \n                    http:\/\/www.coin-or.org\/\n                    \n                  . Last Accessed 28 Jan (2016)"},{"key":"1253_CR57","unstructured":"National Computing Infrastructure (NCI): NCI Website. \n                    http:\/\/www.nci.org.au\n                    \n                  . Last Accessed 19 Nov 2016"},{"issue":"1","key":"1253_CR58","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/641876.641880","volume":"29","author":"E Gertz","year":"2003","unstructured":"Gertz, E., Wright, S.: Object-oriented software for quadratic programming. ACM Trans. Math. Softw. 29(1), 58\u201381 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"1253_CR59","doi-asserted-by":"crossref","unstructured":"Lubin, M., Petra, C., Anitescu, M., Zavala, V.: Scalable stochastic optimization of complex energy systems. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 64:164:10. ACM, Seattle, WA (2011)","DOI":"10.1145\/2063384.2063470"},{"key":"1253_CR60","doi-asserted-by":"crossref","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Society for Industrial and Applied Mathematics (1990)","DOI":"10.1137\/1.9781611971309"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1253-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1253-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1253-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:35:38Z","timestamp":1589646938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1253-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,1]]},"references-count":60,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1253"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1253-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,1]]},"assertion":[{"value":"20 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}