{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:14:55Z","timestamp":1776284095725,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10107-013-0642-3","type":"journal-article","created":{"date-parts":[[2013,2,10]],"date-time":"2013-02-10T23:59:40Z","timestamp":1360540780000},"page":"133-161","source":"Crossref","is-referenced-by-count":47,"title":["Bundle methods for sum-functions with \u201ceasy\u201d components: applications to multicommodity network design"],"prefix":"10.1007","volume":"145","author":[{"given":"Antonio","family":"Frangioni","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Gorgone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"issue":"4","key":"642_CR1","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1137\/100817930","volume":"21","author":"A Astorino","year":"2011","unstructured":"Astorino, A., Frangioni, A., Gaudioso, M., Gorgone, E.: Piecewise quadratic approximations in convex numerical optimization. SIAM J. Optim. 21(4), 1418\u20131438 (2011)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"642_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-007-0151-3","volume":"120","author":"F Babonneau","year":"2009","unstructured":"Babonneau, F., Vial, J.-P.: ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems. Math. Program. 120(1), 179\u2013210 (2009)","journal-title":"Math. Program."},{"key":"642_CR3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1011202900805","volume":"20","author":"L Bacaud","year":"2001","unstructured":"Bacaud, L., Lemar\u00e9chal, C., Renaud, A., Sagastiz\u00e1bal, C.: Bundle methods in stochastic optimal power management: a disaggregated approach using preconditioners. Comput. Optim. Appl. 20, 227\u2013244 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"642_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10107-002-0357-3","volume":"94","author":"L Bahiense","year":"2002","unstructured":"Bahiense, L., Maculan, N., Sagastiz\u00e1bal, C.: The volume algorithm revisited: relation with bundle methods. Math. Program. 94(1), 41\u201370 (2002)","journal-title":"Math. Program."},{"key":"642_CR5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"642_CR6","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"H Ben Amor","year":"2009","unstructured":"Ben Amor, H., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discret. Appl. Math. 157(6), 1167\u20131184 (2009)","journal-title":"Discret. Appl. Math."},{"key":"642_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications. MPS-SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"issue":"1","key":"642_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"DP Bertsekas","year":"2001","unstructured":"Bertsekas, D.P., Nedi\u0107, A.: Incremental subgradient methods for nondifferentiable optimization. SIAM J Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J Optim."},{"key":"642_CR9","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"issue":"1","key":"642_CR10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TPWRS.2002.807114","volume":"18","author":"A Borghetti","year":"2003","unstructured":"Borghetti, A., Frangioni, A., Lacalandra, F., Nucci, C.A.: Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment. IEEE Trans. Power Syst. 18(1), 313\u2013323 (2003)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"642_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-006-0079-z","volume":"113","author":"O Briant","year":"2008","unstructured":"Briant, O., Lemar\u00e9chal, C., Meurdesoif, P., Michel, S., Perrot, N., Vanderbeck, F.: Comparison of bundle and classical column generation. Math. Program. 113(2), 299\u2013344 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"642_CR12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/ijoc.15.4.369.24887","volume":"15","author":"P Cappanera","year":"2003","unstructured":"Cappanera, P., Frangioni, A.: Symmetric and asymmetric parallelization of a cost-decomposition algorithm for multi-commodity flow problems. INFORMS J. Comput. 15(4), 369\u2013384 (2003)","journal-title":"INFORMS J. Comput."},{"key":"642_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0166-218X(00)00310-3","volume":"112","author":"TG Crainic","year":"2001","unstructured":"Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discret. Appl. Math. 112, 73\u201399 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"642_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling\/lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5), 525\u2013545 (2004)","journal-title":"J. Heuristics"},{"issue":"1","key":"642_CR15","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1137\/080718814","volume":"20","author":"G d\u2019Antonio","year":"2009","unstructured":"d\u2019Antonio, G., Frangioni, A.: Convergence analysis of deflected conditional approximate subgradient methods. SIAM J. Optim. 20(1), 357\u2013386 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"642_CR16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1018318117350","volume":"11","author":"O Merle du","year":"1998","unstructured":"du Merle, O., Goffin, J.-L., Vial, J.-P.: On improvements to the analytic center cutting plane method. Comput. Optim. Appl. 11(1), 37\u201352 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"642_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10589-009-9288-8","volume":"46","author":"G Emiel","year":"2010","unstructured":"Emiel, G., Sagastiz\u00e1bal, C.: Incremental-like bundle methods with application to energy planning. Comput. Optim. Appl. 46, 305\u2013332 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"642_CR18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10287-006-0026-8","volume":"4","author":"CI Fabian","year":"2007","unstructured":"Fabian, C.I., Szoke, Z.: Solving two-stage stochastic programming problems with level decomposition. Comput. Manag. Sci. 4(4), 313\u2013353 (2007)","journal-title":"Comput. Manag. Sci."},{"issue":"3","key":"642_CR19","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623498332336","volume":"10","author":"S Feltenmark","year":"2000","unstructured":"Feltenmark, S., Kiwiel, K.: Dual applications of proximal bundle methods, including Lagrangian relaxation of nonconvex problems. SIAM J. Optim. 10(3), 697\u2013721 (2000)","journal-title":"SIAM J. Optim."},{"key":"642_CR20","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1016\/0305-0548(96)00006-8","volume":"21","author":"A Frangioni","year":"1996","unstructured":"Frangioni, A.: Solving semidefinite quadratic problems Within nonsmooth optimization algorithms. Comput. Oper. Res. 21, 1099\u20131118 (1996)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"642_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1137\/S1052623498342186","volume":"13","author":"A Frangioni","year":"2002","unstructured":"Frangioni, A.: Generalized bundle methods. SIAM J. Optim. 13(1), 117\u2013156 (2002)","journal-title":"SIAM J. Optim."},{"key":"642_CR22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-005-3447-9","volume":"139","author":"A Frangioni","year":"2005","unstructured":"Frangioni, A.: About Lagrangian methods in integer optimization. Ann. Oper. Res. 139, 163\u2013193 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"642_CR23","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1287\/ijoc.11.4.370","volume":"11","author":"A Frangioni","year":"1999","unstructured":"Frangioni, A., Gallo, G.: A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. Comput. 11(4), 370\u2013393 (1999)","journal-title":"INFORMS J. Comput."},{"key":"642_CR24","doi-asserted-by":"crossref","unstructured":"Frangioni, A., Gendron, B.: A stabilized structured Dantzig\u2013Wolfe decomposition method. Math. Program. (2013)","DOI":"10.1007\/s10107-012-0626-8"},{"issue":"4","key":"642_CR25","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.1060.0309","volume":"54","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Solving nonlinear single-unit commitment problems with ramping constraints. Oper. Res. 54(4), 767\u2013775 (2006)","journal-title":"Oper. Res."},{"issue":"4","key":"642_CR26","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1080\/00207160600848017","volume":"22","author":"A Frangioni","year":"2007","unstructured":"Frangioni, A., Gentile, C.: Experiments with a hybrid interior point\/combinatorial approach for network flow problems. Optim. Methods Softw. 22(4), 573\u2013585 (2007)","journal-title":"Optim. Methods Softw."},{"key":"642_CR27","unstructured":"Frangioni, A., Gorgone, E.: Generalized Bundle Methods for Sum-Functions with \u201cEasy\u201d Components: Applications to Multicommodity Network Design. Technical Report 12\u201312, Dipartimento di Informatica, Universit\u00e0 di Pisa (2012)"},{"issue":"2\u20133","key":"642_CR28","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-005-0620-5","volume":"104","author":"A Frangioni","year":"2005","unstructured":"Frangioni, A., Lodi, A., Rinaldi, G.: New approaches for optimizing over the semimetric polytope. Math. Program. 104(2\u20133), 375\u2013388 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"642_CR29","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/ijoc.1040.0081","volume":"18","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Manca, A.: A computational study of cost reoptimization for min cost flow problems. INFORMS J. Comput. 18(1), 61\u201370 (2006)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20134","key":"642_CR30","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/B:ANOR.0000039515.90453.1d","volume":"131","author":"I Ghamlouche","year":"2004","unstructured":"Ghamlouche, I., Crainic, T.G., Gendreau, M.: Path relinking, cycle-based neighborhoods and capacitated multicommodity network design. Ann. Oper. Res. 131(1\u20134), 109\u2013133 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"642_CR31","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.51.4.655.16098","volume":"51","author":"I Ghamlouche","year":"2003","unstructured":"Ghamlouche, I., Crainic, T.G., Gendron, B.: Cycle-based neighborhoods for fixed-charge capacitated multicommodity network design. Oper. Res. 51(4), 655\u2013667 (2003)","journal-title":"Oper. Res."},{"issue":"5","key":"642_CR32","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1080\/1055678021000060829a","volume":"17","author":"J-L Goffin","year":"2002","unstructured":"Goffin, J.-L., Vial, J.-P.: Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method. Optim. Methods Softw. 17(5), 805\u2013867 (2002)","journal-title":"Optim. Methods Softw."},{"key":"642_CR33","unstructured":"Gondzio, J., Gonz\u00e1lez-Brevis, P., Munari, P.: New Developments in the Primal-dual Column Generation Technique. Technical Report ERGO-11-001, School of Mathematics, The University of Edinburgh (2011)"},{"issue":"3","key":"642_CR34","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"642_CR35","volume-title":"Convex Analysis and Minimization Algorithms II\u2014Advanced Theory and Bundle Methods, volume 306 of Grundlehren Math. Wiss.","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II\u2014Advanced Theory and Bundle Methods, volume 306 of Grundlehren Math. Wiss. Springer, New York (1993)"},{"issue":"3","key":"642_CR36","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1287\/opre.48.3.461.12439","volume":"48","author":"K Holmberg","year":"2000","unstructured":"Holmberg, K., Yuan, D.: A Lagrangian heuristic based branch-and-bound approach for the capacitated network design problem. Oper. Res. 48(3), 461\u2013481 (2000)","journal-title":"Oper. Res."},{"key":"642_CR37","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01585162","volume":"62","author":"KL Jones","year":"1993","unstructured":"Jones, K.L., Lustig, I.J., Farwolden, J.M., Powell, W.B.: Multicommodity network flows: the impact of formulation on decomposition. Math. Program. 62, 95\u2013117 (1993)","journal-title":"Math. Program."},{"key":"642_CR38","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-007-0187-4","volume":"118","author":"K Kiwiel","year":"2009","unstructured":"Kiwiel, K., Lemar\u00e9chal, C.: An inexact bundle variant suited to column generation. Math. Program. 118, 177\u2013206 (2009)","journal-title":"Math. Program."},{"key":"642_CR39","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s101070050056","volume":"85","author":"KC Kiwiel","year":"1999","unstructured":"Kiwiel, K.C.: A bundle Bregman proximal method for convex nondifferentiable optimization. Math. Program. 85, 241\u2013258 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"642_CR40","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/050639284","volume":"17","author":"KC Kiwiel","year":"2006","unstructured":"Kiwiel, K.C.: A proximal-projection bundle method for Lagrangian relaxation, including semidefinite programming. SIAM J. Optim. 17(4), 1015\u20131034 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"642_CR41","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-009-0327-0","volume":"130","author":"KC Kiwiel","year":"2011","unstructured":"Kiwiel, K.C.: An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems. Math. Program. 130(1), 59\u201384 (2011)","journal-title":"Math. Program."},{"key":"642_CR42","doi-asserted-by":"crossref","unstructured":"Kliewer, G., Timajev, L.: Relax-and-Cut for Capacitated Network Design. In Algorithms\u2014ESA 2005, volume 3669\/2005 of Lecture Notes in Computer Science, pages 47\u201358. Springer, Berlin (2005)","DOI":"10.1007\/11561071_7"},{"key":"642_CR43","first-page":"115","volume-title":"Computational Combinatorial Optimization","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C.: Lagrangian relaxation. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, pp. 115\u2013160. Springer, Heidelberg (2001)"},{"key":"642_CR44","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"3","key":"642_CR45","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10589-007-9160-7","volume":"44","author":"C Lemar\u00e9chal","year":"2009","unstructured":"Lemar\u00e9chal, C., Ouorou, A., Petrou, G.: A bundle-type algorithm for routing in telecommunication data networks. Comput. Optim. Appl. 44(3), 385\u2013409 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"642_CR46","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal, C., Renaud, A.: A geometric study of duality gaps, with applications. Math. Program. 90, 399\u2013427 (2001)","journal-title":"Math. Program."},{"key":"642_CR47","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"642_CR48","volume-title":"Problem Complexity and Method Efficiency in Optimization, volume XV of Wiley-Interscience Series in Discrete Mathematics","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization, volume XV of Wiley-Interscience Series in Discrete Mathematics. Wiley, New York (1983)"},{"issue":"1","key":"642_CR49","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"642_CR50","unstructured":"Nesterov, Y.: Barrier subgradient method. Math. Program. (2013)"},{"issue":"2","key":"642_CR51","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"W Oliveira","year":"2011","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C., Scheimberg, S.: Inexact bundle methods for two-stage stochastic programming. SIAM J. Optim. 21(2), 517\u2013544 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"642_CR52","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/S1052623400374148","volume":"13","author":"MR Oskoorouchi","year":"2003","unstructured":"Oskoorouchi, M.R., Goffin, J.-L.: The analytic center cutting plane method with semidefinite cuts. SIAM J. Optim. 13(4), 1029\u20131053 (2003)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"642_CR53","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10107-008-0209-x","volume":"119","author":"A Ouorou","year":"2009","unstructured":"Ouorou, A.: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119(2), 239\u2013271 (2009)","journal-title":"Math. Program."},{"key":"642_CR54","doi-asserted-by":"crossref","unstructured":"Ouorou, A.: The proximal Chebychev center cutting plane algorithm for convex additive functions. Math. Program. (2013)","DOI":"10.1007\/s10107-012-0630-z"},{"key":"642_CR55","volume-title":"Decompostion Methods, Volume 10 of Handbooks in Operations Research and Management Science","author":"A Ruszczynski","year":"2003","unstructured":"Ruszczynski, A.: Decompostion Methods, Volume 10 of Handbooks in Operations Research and Management Science. Elsevier, Amsterdam (2003)"},{"key":"642_CR56","doi-asserted-by":"crossref","unstructured":"Sagastiz\u00e1bal, C.: Composite proximal bundle method. Math. Program. (2013)","DOI":"10.1007\/s10107-012-0600-5"},{"issue":"1","key":"642_CR57","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H Schramm","year":"1992","unstructured":"Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1), 121\u2013152 (1992)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0642-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-013-0642-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-013-0642-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T10:57:52Z","timestamp":1562669872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-013-0642-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":57,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s10107-013-0642-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}