{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T09:15:17Z","timestamp":1774343717232,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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":["J. Appl. Ind. Math."],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1134\/s1990478910030178","type":"journal-article","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T12:51:46Z","timestamp":1282999906000},"page":"441-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["The branch and cut method for the facility location problem with client\u2019s preferences"],"prefix":"10.1134","volume":"4","author":[{"given":"I. L.","family":"Vasilyev","sequence":"first","affiliation":[]},{"given":"K. B.","family":"Klimentova","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2010,8,29]]},"reference":[{"issue":"1","key":"4113_CR1","first-page":"3","volume":"14","author":"E. V. Alekseev","year":"2007","unstructured":"E. V. Alekseev and Yu. A. Kochetov, \u201cGenetic Local Search for the p-Median Problem with Client\u2019s Preferences,\u201d Diskret. Anal. Issled. Oper. 14(1), 3\u201331 (2007).","journal-title":"Diskret. Anal. Issled. Oper."},{"key":"4113_CR2","volume-title":"Discrete Facility Location Problems and Polynomials of Boolean Variables","author":"V. L. Beresnev","year":"2005","unstructured":"V. L. Beresnev, Discrete Facility Location Problems and Polynomials of Boolean Variables (Inst. Mat., Novosibirsk, 2005) [in Russian]."},{"issue":"6","key":"4113_CR3","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1134\/S0965542509060098","volume":"49","author":"I. L. Vasilyev","year":"2009","unstructured":"I. L. Vasilyev, K. B. Klimentova, and Yu. A. Kochetov, \u201cNew Lower Bounds for the Facility Location Problem with Client\u2019s Preferences,\u201d Comput.Math. Math Phys. 49(6), 1010\u20131020 (2009).","journal-title":"Comput.Math. Math Phys."},{"key":"4113_CR4","volume-title":"Polynomially Solvable and NP-Hard Bilevel Problems of Standardization","author":"L. E. Gorbachevskaya","year":"1998","unstructured":"L. E. Gorbachevskaya, Polynomially Solvable and NP-Hard Bilevel Problems of Standardization, Candidate\u2019s Dissertation inMathematics and Physics (Inst.Mat., Novosibirsk, 1998)."},{"issue":"2","key":"4113_CR5","first-page":"3","volume":"6","author":"L. E. Gorbachevskaya","year":"1999","unstructured":"L. E. Gorbachevskaya, V. T. Dement\u2019ev, and Yu. V. Shamardin, \u201cBilevel Standardization Problem with the Uniqueness Condition of the Optimal Customer Choice,\u201d Diskret. Anal. Issled. Oper. 6(2), 3\u201311 (1999).","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"2","key":"4113_CR6","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.orl.2006.01.012","volume":"35","author":"L. C\u00e1novas","year":"2007","unstructured":"L. C\u00e1novas, S. Garci\u00e1, M. Labb\u00e9, and A. Mar\u00edn, \u201cA Strengthened Formulation for the Simple Plant Location Problem with Order,\u201d Oper. Res. Lett. 35(2), 141\u2013150 (2007).","journal-title":"Oper. Res. Lett."},{"key":"4113_CR7","volume-title":"Foundations of Bilevel Programming","author":"S. Dempe","year":"2002","unstructured":"S. Dempe, Foundations of Bilevel Programming (Kluwer Acad., Dordrecht, 2002)."},{"key":"4113_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0166-0462(87)90011-1","volume":"17","author":"P. Hanjoul","year":"1987","unstructured":"P. Hanjoul and D. Peeters, \u201cA Facility Location Problem with Client\u2019s Preference Ordering,\u201d Regional Sci. Urban Econom. 17, 451\u2013473 (1987).","journal-title":"Regional Sci. Urban Econom."},{"key":"4113_CR9","unstructured":"P. Hansen, Yu. Kochetov, and N. Mladenovic, \u201cLower Bounds for the Uncapacitated Facility Location Problem with User Preferences,\u201d Les Charies du GERAD G-2004-24, pp. 1\u201310 (2004)."},{"issue":"4598","key":"4113_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, \u201cOptimization by Simulated Annealing,\u201d Science 220(4598), 671\u2013680 (1983).","journal-title":"Science"},{"key":"4113_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/0-387-25383-1_16","volume-title":"Metaheuristics: Progress as Real Solvers","author":"Yu. Kochetov","year":"2005","unstructured":"Yu. Kochetov and D. Ivanenko, \u201cComputationally Difficult Instances for the Uncapacitated Facility Location Problem,\u201d in Metaheuristics: Progress as Real Solvers (Springer, New York, 2005), pp. 351\u2013367."},{"key":"4113_CR12","volume-title":"Integer and Combinatorial Optimization","author":"G. N. Nemhauser","year":"1999","unstructured":"G. N. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization (Wiley-Intersci., New York, 1999)."},{"key":"4113_CR13","volume-title":"Production Planning by Mixed Integer Programming","author":"Y. Pochet","year":"2006","unstructured":"Y. Pochet and L. A. Wolsey, Production Planning by Mixed Integer Programming (Springer, New York, 2006)."},{"key":"4113_CR14","volume-title":"Simulated Annealing: Theory and Application","author":"P. J. M. Van Laarhoven","year":"1988","unstructured":"P. J. M. Van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Application (D. Reidel Publ., Dordrecht, 1988)."},{"key":"4113_CR15","unstructured":"http:\/\/www.dashoptimisation.com"}],"container-title":["Journal of Applied and Industrial Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S1990478910030178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S1990478910030178","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S1990478910030178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S1990478910030178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:43:19Z","timestamp":1774330999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S1990478910030178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["4113"],"URL":"https:\/\/doi.org\/10.1134\/s1990478910030178","relation":{},"ISSN":["1990-4789","1990-4797"],"issn-type":[{"value":"1990-4789","type":"print"},{"value":"1990-4797","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"7 November 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}