{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:58:46Z","timestamp":1712426326826},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T00:00:00Z","timestamp":1193097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s10589-007-9072-6","type":"journal-article","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T18:20:26Z","timestamp":1193077226000},"page":"13-39","source":"Crossref","is-referenced-by-count":14,"title":["The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches"],"prefix":"10.1007","volume":"40","author":[{"given":"Mohamed","family":"Haouari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Safa Bhar","family":"Layeb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,23]]},"reference":[{"key":"9072_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)"},{"key":"9072_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1027368621279","volume":"7","author":"L. Bahiense","year":"2003","unstructured":"Bahiense, L., Barahona, F., Porto, O.: Solving Steiner tree problems in graphs with Lagrangian relaxation. J. Comb. Optim. 7, 259\u2013282 (2003)","journal-title":"J. Comb. Optim."},{"key":"9072_CR3","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, 41\u201369 (2002)","journal-title":"Math. Program."},{"key":"9072_CR4","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize-collecting traveling salesman problem. Networks 19, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"9072_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87, 385\u2013399 (2000)","journal-title":"Math. Program."},{"key":"9072_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230190102","volume":"19","author":"J.E. Beasley","year":"1989","unstructured":"Beasley, J.E.: An SST-based algorithm for the Steiner problem in graphs. Networks 19, 1\u201316 (1989)","journal-title":"Networks"},{"key":"9072_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"key":"9072_CR8","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1016\/j.cor.2003.11.007","volume":"32","author":"C. Blum","year":"2005","unstructured":"Blum, C., Blesa, M.J.: New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput. Oper. Res. 32, 1355\u20131377 (2005)","journal-title":"Comput. Oper. Res."},{"key":"9072_CR9","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0166-218X(02)00548-6","volume":"128","author":"C. Blum","year":"2003","unstructured":"Blum, C., Ehrgott, M.: Local search algorithms for the k-cardinality tree problem. Discrete Appl. Math. 128, 511\u2013540 (2003)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"Bornd\u00f6rfer, R., Fereira, C., Martin, A.: Decomposing matrices into blocks. SIAM J. Optim. 9, 236\u2013269 (1998)","journal-title":"SIAM J. Optim."},{"key":"9072_CR11","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","volume":"3","author":"P.M. Camerini","year":"1975","unstructured":"Camerini, P.M., Frata, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. Math. Program. Study 3, 26\u201334 (1975)","journal-title":"Math. Program. Study"},{"key":"9072_CR12","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50\u201358 (2001)","journal-title":"Networks"},{"key":"9072_CR13","first-page":"357","volume-title":"Symposia Mathematica, vol. XIX","author":"H. Crowder","year":"1976","unstructured":"Crowder, H.: Computational improvements for subgradient optimization. In: Symposia Mathematica, vol. XIX, pp. 357\u2013372. Academic Press, London (1976)"},{"key":"9072_CR14","first-page":"227","volume":"5","author":"D.Z. Du","year":"2001","unstructured":"Du, D.Z., Lu, B., Ngo, H., Pardalos, P.M.: Steiner tree problems. Encycl. Optim. 5, 227\u2013290 (2001)","journal-title":"Encycl. Optim."},{"key":"9072_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0377-2217(02)00707-5","volume":"154","author":"C.W. Duin","year":"2004","unstructured":"Duin, C.W., Volgenant, A., Vo\u00df, S.: Solving group Steiner problems as Steiner problems. Eur. J. Oper. Res. 154, 323\u2013329 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9072_CR16","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(96)00084-7","volume":"93","author":"M. Ehrgott","year":"1996","unstructured":"Ehrgott, M., Freitag, J.: k-tree\/k-subgraph: a\u00a0program package for minimal weighted k-cardinality trees and subgraphs. Eur. J. Oper. Res. 93, 224\u2013225 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9072_CR17","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.10009","volume":"39","author":"C. Feremans","year":"2002","unstructured":"Feremans, C., Labb\u00e9, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39, 29\u201334 (2002)","journal-title":"Networks"},{"key":"9072_CR18","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230240103","volume":"24","author":"M. Fischetti","year":"1994","unstructured":"Fischetti, M., Hamacher, H.W., J\u00f6rnsten, K., Maffioli, F.: Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24, 11\u201321 (1994)","journal-title":"Networks"},{"key":"9072_CR19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1023\/A:1018925728178","volume":"81","author":"L.R. Foulds","year":"1998","unstructured":"Foulds, L.R., Hamacher, H.W., Wilson, J.: Integer programming approaches to facilities models with forbidden areas. Ann. Oper. Res. 81, 405\u2013417 (1998)","journal-title":"Ann. Oper. Res."},{"key":"9072_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02523691","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Hochbaum, D.: An O(log\u2009k) approximation algorithm for the k minimum spanning tree problem in the plane. Algorithmica 18, 111\u2013121 (1997)","journal-title":"Algorithmica"},{"key":"9072_CR21","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"Geoffrion, A.: Lagrangian relaxation and its uses in integer programming. Math. Program. Study 2, 82\u2013114 (1974)","journal-title":"Math. Program. Study"},{"key":"9072_CR22","first-page":"144","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"M.X. Goemans","year":"1997","unstructured":"Goemans, M.X., Williamson, D.P.: The primal\u2013dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 144\u2013191. PWS, Boston (1997)"},{"key":"9072_CR23","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","volume":"13","author":"J.L. Goffin","year":"1977","unstructured":"Goffin, J.L.: On convergence rates of subgradient optimization methods. Math. Program. 13, 329\u2013347 (1977)","journal-title":"Math. Program."},{"key":"9072_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M. Guignard","year":"1987","unstructured":"Guignard, M., Kim, S.: Lagrangian decomposition: a model yielding stronger Lagrangian bounds. Math. Program. 39, 215\u2013228 (1987)","journal-title":"Math. Program."},{"key":"9072_CR25","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1016\/j.ejor.2004.07.072","volume":"171","author":"M. Haouari","year":"2006","unstructured":"Haouari, M., Chaouachi, J.: Lower and upper bounding strategies for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 171, 632\u2013647 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9072_CR26","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1016\/j.cor.2004.09.017","volume":"33","author":"M. Haouari","year":"2006","unstructured":"Haouari, M., Chaouachi, J.: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Comput. Oper. Res. 33, 1274\u20131288 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9072_CR27","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1057\/palgrave.jors.2601821","volume":"56","author":"M. Haouari","year":"2005","unstructured":"Haouari, M., Chaouachi, J., Dror, M.: Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm. J.\u00a0Oper. Res. Soc. 56, 382\u2013389 (2005)","journal-title":"J.\u00a0Oper. Res. Soc."},{"key":"9072_CR28","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M. Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6, 62\u201388 (1974)","journal-title":"Math. Program."},{"key":"9072_CR29","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","volume":"37","author":"C.S. Helvig","year":"2001","unstructured":"Helvig, C.S., Robins, G., Zelikovsky, A.: An improved approximation scheme for the group Steiner problem. Networks 37, 820 (2001)","journal-title":"Networks"},{"key":"9072_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1993)"},{"key":"9072_CR31","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22, 55\u201389 (1992)","journal-title":"Networks"},{"key":"9072_CR32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0166-218X(98)00090-0","volume":"90","author":"E. Ihler","year":"1999","unstructured":"Ihler, E., Reich, G., Widmayer, P.: Class Steiner trees and VLSI-design. Discrete Appl. Math. 90, 173\u2013194 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR33","first-page":"149","volume":"16","author":"Y. Ikura","year":"1982","unstructured":"Ikura, Y., Nemhauser, G.L.: An efficient primal simplex algorithm for maximum weighted vertex packing on bipartite graphs. Ann. Discrete Math. 16, 149\u2013168 (1982)","journal-title":"Ann. Discrete Math."},{"key":"9072_CR34","unstructured":"Johnson, D.S., Minkoff, M., Philips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the 11th ACM\u2013SIAM Symposium on Discrete Mathematics, San Fransisco, CA, pp.\u00a0760\u2013769 (2000)"},{"key":"9072_CR35","first-page":"9","volume":"14","author":"K. J\u00f6rnsten","year":"1997","unstructured":"J\u00f6rnsten, K., Lokketangen, A.: Tabu search for weighted k-cardinality trees. Asia-Pac. J. Oper. Res. 14, 9\u201326 (1997)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9072_CR36","first-page":"225","volume-title":"Handbooks in Operational Research and Management Science, vol.\u00a07","author":"M. J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G.: The travelling salesman problem. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbooks in Operational Research and Management Science, vol.\u00a07, pp. 225\u2013330. North-Holland, Amsterdam (1995)"},{"key":"9072_CR37","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B. Kallehauge","year":"2006","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33, 1464\u20131487 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9072_CR38","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/A:1008739111712","volume":"15","author":"F. Kappel","year":"2000","unstructured":"Kappel, F., Kuntsevich, A.V.: An implementation of Shor\u2019s r-algorithm. Comput. Optim. Appl. 15, 193\u2013205 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"9072_CR39","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0377-2217(99)00092-2","volume":"122","author":"S. Kataoka","year":"2000","unstructured":"Kataoka, S., Araki, N.: Upper and lower bounding procedures for minimum rooted k-subtree problem. Eur. J. Oper. Res. 122, 561\u2013569 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9072_CR40","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting-plane method for solving convex programs. J.\u00a0SIAM 8, 703\u2013712 (1960)","journal-title":"J.\u00a0SIAM"},{"key":"9072_CR41","unstructured":"Lemar\u00e9chal, C., Bundle method in nonsmooth optimization. In: Lemar\u00e9chal, C., Mifflin, R. (eds.) Nonsmooth Optimization: Proceedings of IIASA Workshop, pp.\u00a079\u2013109 (1978)"},{"key":"9072_CR42","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02614390","volume":"76","author":"C. Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal, C., Sagastizabal, C.: Variable metric bundle methods: From conceptual to implementable forms. Math. Program. 76, 393\u2013410 (1997)","journal-title":"Math. Program."},{"key":"9072_CR43","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubic","year":"2006","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Math. Program. 105, 427\u2013449 (2006)","journal-title":"Math. Program."},{"key":"9072_CR44","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A. Lucena","year":"2004","unstructured":"Lucena, A., Resende, M.G.C.: Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Appl. Math. 141, 277\u2013294 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR45","first-page":"503","volume-title":"Handbooks in Operational Research and Management Science, vol.\u00a07","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Handbooks in Operational Research and Management Science, vol.\u00a07, pp. 503\u2013615. North-Holland, Amsterdam (1995)"},{"key":"9072_CR46","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"R.E. Marsten","year":"1975","unstructured":"Marsten, R.E., Hogan, W.W., Blankenship, J.W.: The BOXSTEP method for large-scale optimization. Oper. Res. 23, 389\u2013405 (1975)","journal-title":"Oper. Res."},{"key":"9072_CR47","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.2.2.191","volume":"2","author":"R. Mifflin","year":"1977","unstructured":"Mifflin, R.: An algorithm for constrained optimization with semismooth functions. Math. Oper. Res. 2, 191\u2013207 (1977)","journal-title":"Math. Oper. Res."},{"key":"9072_CR48","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y.S. Myung","year":"1995","unstructured":"Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26, 231\u2013241 (1995)","journal-title":"Networks"},{"key":"9072_CR49","first-page":"593","volume":"8","author":"B.T. Polyak","year":"1967","unstructured":"Polyak, B.T.: A general method of solving extremum problems. Sov. Math. Dokl. 8, 593\u2013597 (1967)","journal-title":"Sov. Math. Dokl."},{"key":"9072_CR50","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. 9, 14\u201329 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9072_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","volume-title":"Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, WG\u201989","author":"G. Reich","year":"1990","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: a VLSI oriented generalization. In: Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, WG\u201989. Lecture Notes in Computer Science, vol. 411, pp. 196\u2013210. Springer, Berlin (1990)"},{"key":"9072_CR52","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0166-218X(99)00200-0","volume":"100","author":"J.J. Salazar","year":"2000","unstructured":"Salazar, J.J.: A note on the generalized Steiner tree polytope. Discrete Appl. Math. 100, 137\u2013144 (2000)","journal-title":"Discrete Appl. Math."},{"key":"9072_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A. Segev","year":"1987","unstructured":"Segev, A.: The node-weighted Steiner tree problem. Networks 17, 1\u201317 (1987)","journal-title":"Networks"},{"key":"9072_CR54","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1011272319638","volume":"19","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Choi, G., Ansari, Z.: Limited memory space dilatation and reduction algorithms. Comput. Optim. Appl. 19, 55\u201377 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"9072_CR55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00063-2","volume":"26","author":"H.D. Sherali","year":"2000","unstructured":"Sherali, H.D., Choi, G., Tuncbilek, C.H.: A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26, 1\u20138 (2000)","journal-title":"Oper. Res. Lett."},{"key":"9072_CR56","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"H.D. Sherali","year":"1989","unstructured":"Sherali, H.D., Ulular, O.: A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20, 193\u2013221 (1989)","journal-title":"Appl. Math. Optim."},{"key":"9072_CR57","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0022-247X(90)90109-S","volume":"150","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Ulular, O.: Conjugate gradient methods using quasi-Newton updates with inexact line searches. J.\u00a0Math. Anal. Appl. 150, 359\u2013377 (1990)","journal-title":"J.\u00a0Math. Anal. Appl."},{"key":"9072_CR58","first-page":"6","volume":"1","author":"N.Z. Shor","year":"1970","unstructured":"Shor, N.Z.: Utilization of the operation of space dilatation in the minimization of convex functions. Kibernetika 1, 6\u201312 (1970)","journal-title":"Kibernetika"},{"key":"9072_CR59","first-page":"80","volume":"2","author":"N.Z. Shor","year":"1970","unstructured":"Shor, N.Z.: Convergence rate of the gradient descent method with dilatation of the space. Kibernetika 2, 80\u201385 (1970)","journal-title":"Kibernetika"},{"key":"9072_CR60","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Nondifferentiable Functions","author":"N.Z. Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Nondifferentiable Functions. Springer, Berlin (1985)"},{"key":"9072_CR61","first-page":"82","volume":"1","author":"N.Z. Shor","year":"1972","unstructured":"Shor, N.Z., Shabashova, L.P.: Solution of minimax problems by the method of generalized gradient descent with dilatation of the space. Kibernetika 1, 82\u201388 (1972)","journal-title":"Kibernetika"},{"key":"9072_CR62","first-page":"51","volume":"3","author":"N.Z. Shor","year":"1971","unstructured":"Shor, N.Z., Zhurbenko, N.G.: A minimization method using the operation of space dilatation in the direction of the difference of two successive gradients. Kibernetika 3, 51\u201359 (1971)","journal-title":"Kibernetika"},{"key":"9072_CR63","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s002360000042","volume":"37","author":"B. Yang","year":"2000","unstructured":"Yang, B., Gillard, P.: The class Steiner minimal tree problem: a\u00a0lower bound and test problem generation. Acta Informatica 37, 193\u2013211 (2000)","journal-title":"Acta Informatica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9072-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9072-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9072-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:32Z","timestamp":1559302592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9072-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,23]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9072"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9072-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,23]]}}}