{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:38:18Z","timestamp":1774715898774,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,30]],"date-time":"2014-09-30T00:00:00Z","timestamp":1412035200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-014-0822-9","type":"journal-article","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T15:30:49Z","timestamp":1412004649000},"page":"405-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Completely positive reformulations for polynomial optimization"],"prefix":"10.1007","volume":"151","author":[{"given":"Javier","family":"Pe\u00f1a","sequence":"first","affiliation":[]},{"given":"Juan C.","family":"Vera","sequence":"additional","affiliation":[]},{"given":"Luis F.","family":"Zuluaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,30]]},"reference":[{"issue":"1\u20132","key":"822_CR1","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10107-013-0690-8","volume":"146","author":"P Amaral","year":"2014","unstructured":"Amaral, P., Bomze, I.M., J\u00fadice, J.: Copositivity and constrained fractional quadratic problems. Math. Program. 146(1\u20132), 325\u2013350 (2014)","journal-title":"Math. Program."},{"key":"822_CR2","doi-asserted-by":"crossref","unstructured":"Anjos, M., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization Handbook on Semidefinite, Conic and Polynomial Optimization, volume 166 of International Series in Operations Research & Management Science. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"822_CR3","unstructured":"Arima, N., Kim, S., Kojima, M. A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming. Technical Report B-468, Dept. of Math. and Comp. Sciences, Tokyo Institute of Technology. http:\/\/www.optimization-online.org\/DB_FILE\/2012\/09\/3600.pdf (2012)"},{"key":"822_CR4","unstructured":"Bai, L., Mitchell, J.E., Pang, J.: On QPCCs, QCQPs and Copositive Programs. Technical report, Rensselaer Polytechnic Institute. http:\/\/eaton.math.rpi.edu\/faculty\/Mitchell\/papers\/QCQP_QPCC.html (2012)"},{"key":"822_CR5","volume-title":"Non-linear Programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Non-linear Programming. Athena Scientific, Belmont, MA (1995)"},{"key":"822_CR6","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/opre.50.2.358.424","volume":"50","author":"D Bertsimas","year":"2002","unstructured":"Bertsimas, D., Popescu, I.: On the relation between option and stock prices: an optimization approach. Oper. Res. 50, 358\u2013374 (2002)","journal-title":"Oper. Res."},{"issue":"3","key":"822_CR7","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S1052623401399903","volume":"15","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Popescu, I.: Optimal inequalities in probability theory: a convex optimization approach. SIAM J. Optim. 15(3), 780\u2013804 (2005)","journal-title":"SIAM J. Optim."},{"key":"822_CR8","doi-asserted-by":"crossref","unstructured":"Blekherman, G., Parrilo, P., and Thomas, R. (eds): Semidefinite Optimization and Convex Algebraic Geometry, volume 13 of MOS-SIAM Series on Optimization. SIAM, Philadelphia (2012)","DOI":"10.1137\/1.9781611972290"},{"issue":"2","key":"822_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I Bomze","year":"2002","unstructured":"Bomze, I., de Klerk, E.: Solving standard quadratic optimization problems via semidefinite and copositive programming. J. Global Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"3","key":"822_CR10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s11590-010-0174-1","volume":"4","author":"I Bomze","year":"2010","unstructured":"Bomze, I., Jarre, F.: A note on Burer\u2019s copositive representation of mixed-binary QPs. Optim. Lett. 4(3), 465\u2013472 (2010)","journal-title":"Optim. Lett."},{"key":"822_CR11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/978-0-387-74759-0_99","volume-title":"Encyclopedia of Optimization","author":"IM Bomze","year":"2009","unstructured":"Bomze, I.M.: Copositive optimization. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, 2nd edn, pp. 561\u2013564. Springer, Berlin (2009)","edition":"2"},{"key":"822_CR12","unstructured":"Bomze, I.M.: Copositive Relaxation Beats Lagrangian Dual Bounds In Quadratically And Linearly Constrained QPs. Technical Report NI13064-POP, Isaac Newton Institute (2013)"},{"key":"822_CR13","unstructured":"Bomze, I.M.: Copositive-Based Approximations for Binary and Ternary Fractional Quadratic Optimization. Technical Report NI14043-POP, Isaac Newton Institute (2014)"},{"key":"822_CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., De Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"822_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s12532-011-0022-z","volume":"3","author":"IM Bomze","year":"2011","unstructured":"Bomze, I.M., Jarre, F., Rendl, F.: Quadratic factorization heuristics for copositive programming. Math. Program. Comput. 3(1), 37\u201357 (2011)","journal-title":"Math. Program. Comput."},{"key":"822_CR16","unstructured":"Bundfuss, S.: Copositive Matrices, Copositive Programming, and Applications. Ph.D. thesis, TU Darmstadt (2009)"},{"issue":"1","key":"822_CR17","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20(1), 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"822_CR18","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"3","key":"822_CR19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"key":"822_CR20","doi-asserted-by":"crossref","unstructured":"Burer, S., Kim, S., Kojima, M.: Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. 59(1\u20132), 27\u201345 (2014)","DOI":"10.1007\/s10589-013-9618-8"},{"issue":"1","key":"822_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"2\u20133","key":"822_CR22","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E Klerk de","year":"2006","unstructured":"de Klerk, E., Laurent, M., Parrilo, P.A.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theor. Comput. Sci. 361(2\u20133), 210\u2013225 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"822_CR23","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E Klerk de","year":"2002","unstructured":"de Klerk, E., Pasechnik, D.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12(4), 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"822_CR24","doi-asserted-by":"crossref","unstructured":"Dickinson, P.J., Eichfelder, G., Povh, J.: Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets [optim. letters, 2012]. Optim. Lett. 7(6), 1387\u20131397 (2013)","DOI":"10.1007\/s11590-013-0645-2"},{"key":"822_CR25","doi-asserted-by":"crossref","first-page":"022308","DOI":"10.1103\/PhysRevA.69.022308","volume":"69","author":"AC Doherty","year":"2004","unstructured":"Doherty, A.C., Parrilo, P.A., Spedalieri, F.M.: An inequality for circle packings proved by semidefinite programming. Phys. Rev. A 69, 022308 (2004)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"822_CR26","doi-asserted-by":"crossref","first-page":"1850","DOI":"10.1137\/100813816","volume":"23","author":"H Dong","year":"2013","unstructured":"Dong, H.: Symmetric tensor approximation hierarchies for the completely positive cone. SIAM J. Optim. 23(3), 1850\u20131866 (2013)","journal-title":"SIAM J. Optim."},{"key":"822_CR27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10107-011-0485-8","volume":"137","author":"H Dong","year":"2013","unstructured":"Dong, H., Anstreicher, K.: Separating doubly nonnegative and completely positive matrices. Math. Program. Ser. A 137, 131\u2013153 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"822_CR28","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10107-008-0233-x","volume":"121","author":"I Dukanovic","year":"2010","unstructured":"Dukanovic, I., Rendl, F.: Copositive programming motivated bounds on the stability and the chromatic numbers. Math. Program. 121(2), 249\u2013268 (2010)","journal-title":"Math. Program."},{"key":"822_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and its Applications in Engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming\u2013a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, Berlin (2010)"},{"issue":"2","key":"822_CR30","first-page":"1","volume":"6","author":"G Eichfelder","year":"2012","unstructured":"Eichfelder, G., Povh, J.: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 6(2), 1\u201314 (2012)","journal-title":"Optim. Lett."},{"key":"822_CR31","unstructured":"Genin, Y., Hachez, Y., Nesterov, Y., and Dooren, P. V.: Convex optimization over positive polynomials and filter design. In: Proceedings of UKACC Intenational Conference on Control (2000)"},{"key":"822_CR32","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P.A., Thomas, R.R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20, 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"key":"822_CR33","doi-asserted-by":"crossref","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 3509, 136\u2013151 (2005)","DOI":"10.1007\/11496915_11"},{"issue":"2","key":"822_CR34","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/050648237","volume":"19","author":"N Gvozdenovi\u0107","year":"2008","unstructured":"Gvozdenovi\u0107, N., Laurent, M.: The operator $$\\psi $$ \u03c8 for the chromatic number of a graph. SIAM J. Optim. 19(2), 572\u2013591 (2008)","journal-title":"SIAM J. Optim."},{"key":"822_CR35","unstructured":"Kim, S., Kojima, M., Toh, K.: A Lagrangian-DDN Relaxation: A Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems. Technical report. http:\/\/www.optimizationonlineorg\/DBHTML\/2013\/10\/4073.html (2013)"},{"issue":"3","key":"822_CR36","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization problems with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"822_CR37","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1214\/aoap\/1031863183","volume":"12","author":"J Lasserre","year":"2002","unstructured":"Lasserre, J.: Bounds on measures satisfying moment conditions. Ann. Appl. Probab. 12, 1114\u20131137 (2002a)","journal-title":"Ann. Appl. Probab."},{"key":"822_CR38","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12, 756\u2013769 (2002b)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"822_CR39","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 integer programming. Math. Oper. Res. 28(3), 470\u2013496 (2003a)","journal-title":"Math. Oper. Res."},{"key":"822_CR40","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. Math. Oper. Res. 28(4), 871\u2013883 (2003b)","DOI":"10.1287\/moor.28.4.871.20508"},{"key":"822_CR41","first-page":"8","volume":"89","author":"M Laurent","year":"2012","unstructured":"Laurent, M.: Copositive vs. moment hierarchies for stable sets. Optima 89, 8\u201310 (2012)","journal-title":"Optima"},{"key":"822_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"822_CR43","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1287\/opre.1110.0918","volume":"59","author":"K Natarajan","year":"2011","unstructured":"Natarajan, K., Teo, C.P., Zheng, Z.: Mixed 0\u20131 linear programs under objective uncertainty: a completely positive representation. Oper. Res. 59(3), 713\u2013728 (2011)","journal-title":"Oper. Res."},{"key":"822_CR44","unstructured":"Nesterov, Y.: Structure of Non-negative Polynomials and Optimization Problems. Technical Report 9749, CORE (1997)"},{"issue":"2","key":"822_CR45","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10589-007-9131-z","volume":"43","author":"J Nie","year":"2009","unstructured":"Nie, J.: Sum of squares method for sensor network localization. Comput. Optim. Appl. 43(2), 151\u2013179 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"822_CR46","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1109\/TAC.2009.2017168","volume":"54","author":"A Papachristodoulou","year":"2009","unstructured":"Papachristodoulou, A., Peet, M.M., Lall, S.: Analysis of polynomial systems with time delays via the sum of squares decomposition. IEEE Trans. Autom. Control 54(5), 1058\u20131064 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"key":"822_CR47","unstructured":"Parrilo, P.: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. Ph.D. thesis, Department of Control and Dynamical Systems, California Institute of Technology, Pasadena, CA (2000)"},{"issue":"10","key":"822_CR48","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1016\/j.laa.2007.12.027","volume":"428","author":"PA Parrilo","year":"2008","unstructured":"Parrilo, P.A., Jadbabaie, A.: Approximation of the joint spectral radius using sum of squares. Linear Algebra Appl. 428(10), 2385\u20132402 (2008)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"822_CR49","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/05064401X","volume":"18","author":"J Pe\u00f1a","year":"2007","unstructured":"Pe\u00f1a, J., Vera, J., Zuluaga, L.: Computing the stability number of a graph via linear and semidefinite programming. SIAM J. Optim. 18(1), 87\u2013105 (2007)","journal-title":"SIAM J. Optim."},{"key":"822_CR50","unstructured":"P\u00f3lya, G.: \u00dcher positive Darstellung von Polynomen. Vierteljschr. Naturforsch. Ges. Z\u00fcrich 73, 141\u2013145. (also Collected Papers, vol. 2, 309\u2013313, MIT Press, Cambridge, MA, 1974) (1928)"},{"issue":"1","key":"822_CR51","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh, J., Rendl, F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18(1), 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"822_CR52","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6(3), 231\u2013241 (2009)","journal-title":"Discret. Optim."},{"key":"822_CR53","unstructured":"Reznick, B.: On Hilbert\u2019s Construction of Positive Polynomials. Technical report, University of Illinois at Urbana-Champaign. www.math.uiuc.edu\/reznick\/paper53.pdf (2007)"},{"key":"822_CR54","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"T Rockafellar","year":"1970","unstructured":"Rockafellar, T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"822_CR55","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"T Rockafellar","year":"1998","unstructured":"Rockafellar, T., Wets, R.: Variational Analysis. Springer, Berlin (1998)"},{"key":"822_CR56","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen, K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289, 203\u2013206 (1991)","journal-title":"Math. Ann."},{"issue":"4","key":"822_CR57","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25(4), 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"822_CR58","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0022-4049(01)00041-X","volume":"166","author":"M Schweighofer","year":"2002","unstructured":"Schweighofer, M.: An algorithmic approach to Schm\u00fcdgen\u2019s positivstellensatz. J. Pure Appl. Algebra 166(3), 307\u2013319 (2002)","journal-title":"J. Pure Appl. Algebra"},{"key":"822_CR59","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/BF01070233","volume":"23","author":"N Shor","year":"1987","unstructured":"Shor, N.: Class of global minimum bounds of polynomial functions. Cybernetics 23, 731\u2013734 (1987)","journal-title":"Cybernetics"},{"key":"822_CR60","doi-asserted-by":"crossref","unstructured":"Zuluaga, L., Vera, J., Pe\u00f1a, J.: LMI approximations for cones of positive semidefinite forms. SIAM J. Optim. 16, 1076\u20131091 (2006)","DOI":"10.1137\/03060151X"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0822-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0822-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0822-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T15:00:26Z","timestamp":1565881226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0822-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,30]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["822"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0822-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,30]]}}}