{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:23:42Z","timestamp":1773617022075,"version":"3.50.1"},"reference-count":19,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1134\/s0005117919010041","type":"journal-article","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T13:40:54Z","timestamp":1554298854000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable Neighborhood Search for a Two-Stage Stochastic Programming Problem with a Quantile Criterion"],"prefix":"10.1134","volume":"80","author":[{"given":"S. V.","family":"Ivanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. I.","family":"Kibzun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"909_CR1","volume-title":"Introduction to Stochastic Programming","author":"J. Birge","year":"1997","unstructured":"Birge, J. and Louveaux, F., Introduction to Stochastic Programming, New York: Springer-Verlag, 1997."},{"key":"909_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming, Philadelphia: Society for Industrial and Applied Mathematics (SIAM)","author":"A. Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., and Ruszczy\u0144ski, A., Lectures on Stochastic Programming, Philadelphia: Society for Industrial and Applied Mathematics (SIAM), 2009."},{"issue":"3","key":"909_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1080\/1055678021000033937","volume":"17","author":"P. Beraldi","year":"2002","unstructured":"Beraldi, P. and Ruszczy\u0144ski, A., A Branch and Bound Method for Stochastic Integer Problems under Probabilistic Constraints, Optim. Method. Software, 2002, vol. 17, no. 3, pp. 359\u2013382.","journal-title":"Optim. Method. Software"},{"key":"909_CR4","volume-title":"Stochastic Programming Problems with Probability and Quantile Functions","author":"A.I. Kibzun","year":"1996","unstructured":"Kibzun, A.I. and Kan, Y.S., Stochastic Programming Problems with Probability and Quantile Functions, Chichester: Wiley, 1996."},{"issue":"6","key":"909_CR5","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1002\/asmb.2115","volume":"31","author":"A.I. Kibzun","year":"2015","unstructured":"Kibzun, A.I., Comparison of Two Algorithms for Solving a Two-Stage Bilinear Stochastic Programming Problem with Quantile Criterion, Appl. Stoch. Model. Business Industry, 2015, vol. 31, no. 6, pp. 862\u2013874.","journal-title":"Appl. Stoch. Model. Business Industry"},{"key":"909_CR6","first-page":"1","volume":"2","author":"Z. Artstein","year":"1996","unstructured":"Artstein, Z. and Wets, R.J.-B., Consistency of Minimizers and the SLLN for Stochastic Programs, J. Convex Anal., 1996, vol. 2, pp. 1\u201317.","journal-title":"J. Convex Anal."},{"key":"909_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"B.K. Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., and Shapiro, A., Sample Average ApproximationMethod for Chance Constrained Programming: Theory and Applications, J. Optim. Theory Appl., 2009, vol. 142, pp. 399\u2013416.","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"909_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1134\/S0005117918020029","volume":"79","author":"S.V. Ivanov","year":"2018","unstructured":"Ivanov, S.V. and Kibzun, A.I., On the Convergence of Sample Approximations for Stochastic Programming Problems with Probabilistic Criteria, Autom. Remote Control, 2018, vol. 79, no. 2, pp. 216\u2013228.","journal-title":"Autom. Remote Control"},{"issue":"3","key":"909_CR9","first-page":"134","volume":"23","author":"S.V. Ivanov","year":"2017","unstructured":"Ivanov, S.V. and Kibzun, A.I., Sample Average Approximation in the Two-Stage Stochastic Linear Programming Problem with Quantile Criterion, Tr. Inst. Mat. Mekh. UrO RAN, 2017, vol. 23, no. 3, pp. 134\u2013143.","journal-title":"Tr. Inst. Mat. Mekh. UrO RAN"},{"issue":"5","key":"909_CR10","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/10556788.2017.1350177","volume":"32","author":"V. Guigues","year":"2017","unstructured":"Guigues, V., Juditsky, A., and Nemirovski, A., Non-Asymptotic Confidence Bounds for the Optimal Value of a Stochastic Program, Optim. Method. Software, 2017, vol. 32, no. 5, pp. 1033\u20131058.","journal-title":"Optim. Method. Software"},{"issue":"6","key":"909_CR11","first-page":"476","volume":"23","author":"R. Lepp","year":"1987","unstructured":"Lepp, R., Approximate Solution of Stochastic Programming Problems with Recourse, Kybernetika, 1987, vol. 23, no. 6, pp. 476\u2013482.","journal-title":"Kybernetika"},{"issue":"3","key":"909_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1080\/1055678021000033991","volume":"17","author":"R. Lepp","year":"2002","unstructured":"Lepp, R., Approximation of the Quantile Minimization Problem with Decision Rules, Optim. Method. Software, 2002, vol. 17, no. 3, pp. 505\u2013522.","journal-title":"Optim. Method. Software"},{"issue":"1","key":"909_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2005.07.020","volume":"176","author":"S. Benati","year":"2007","unstructured":"Benati, S. and Rizzi, R., A Mixed Integer Linear Programming Formulation of the Optimal Mean\/Valueat-Risk Portfolio Problem, Eur. J. Oper. Res., 2007, vol. 176, no. 1, pp. 423\u2013434.","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"909_CR14","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s10559-014-9658-9","volume":"50","author":"V.I. Norkin","year":"2014","unstructured":"Norkin, V.I., Kibzun, A.I., and Naumov, A.V., Reducing Two-Stage Probabilistic Optimization Problems with Discrete Distribution of Random Data to Mixed-Integer Programming Problems, Cybernet. Syst. Anal., 2014, vol. 50, no. 5, pp. 679\u2013692.","journal-title":"Cybernet. Syst. Anal."},{"key":"909_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-002-0337-7","volume":"93","author":"A. Ruszczy\u0144ski","year":"2002","unstructured":"Ruszczy\u0144ski, A., Probabilistic Programming with Discrete Distributions and Precedence Constrained Knapsack Polyhedra, Math. Program., 2002, vol. 93, pp. 195\u2013215.","journal-title":"Math. Program."},{"issue":"11","key":"909_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N. and Hansen, P., Variable Neighborhood Search, Comput. Oper. Res., 1997, vol. 24, no. 11, pp. 1097\u20131100.","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"909_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P. Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., and P\u00e9rez, J.A.M., Variable Neighbourhood Search: Methods and Applications, Ann. Oper. Res., 2010, vol. 175, no. 1, pp. 367\u2013407.","journal-title":"Ann. Oper. Res."},{"key":"909_CR18","volume-title":"Variable Neighborhood Search, in Handbook of Heuristics, Mart\u00b4\u0131, R., Pardalos, P., and Resende, M., Eds.","author":"P. Hansen","year":"2016","unstructured":"Hansen, P. and Mladenovi\u0107, N., Variable Neighborhood Search, in Handbook of Heuristics, Mart\u00b4\u0131, R., Pardalos, P., and Resende, M., Eds., Cham: Springer, 2016."},{"issue":"5","key":"909_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P. Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., and Hanafi, S., Variable Neighborhood Search: Basics and Variants, EURO J. Comput. Optim., 2017, vol. 5, no. 5, pp. 423\u2013454.","journal-title":"EURO J. Comput. Optim."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919010041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117919010041","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117919010041.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:32:05Z","timestamp":1773613925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117919010041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["909"],"URL":"https:\/\/doi.org\/10.1134\/s0005117919010041","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]},"assertion":[{"value":"15 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}