{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:59:00Z","timestamp":1774367940269,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10852-012-9203-7","type":"journal-article","created":{"date-parts":[[2012,8,31]],"date-time":"2012-08-31T10:39:52Z","timestamp":1346409592000},"page":"105-116","source":"Crossref","is-referenced-by-count":6,"title":["Solving a Bicriteria Problem of Optimal Service Centers Location"],"prefix":"10.1007","volume":"12","author":[{"given":"Alexander A.","family":"Kolokolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidia A.","family":"Zaozerskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,1]]},"reference":[{"issue":"6","key":"9203_CR1","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., Carrera, M.C.: A dynamic subgradient-based branch and bound procedure for set covering. Oper. Res. 44(6), 875\u2013890 (1996)","journal-title":"Oper. Res."},{"key":"9203_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BFb0120886","volume":"12","author":"E Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. Math. Program. Study 12, 37\u201360 (1980)","journal-title":"Math. Program. Study"},{"issue":"2","key":"9203_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beasley","year":"1996","unstructured":"Beasley, J.E., Chu P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 394\u2013404 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9203_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0377-2217(92)90215-U","volume":"58","author":"JE Beasley","year":"1992","unstructured":"Beasley, J.E., J\u00f6rnsten, K.: Enhancing an algorithm for set covering problems. Eur. J. Oper. Res. 58, 293\u2013300 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"9203_CR5","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Algorithms for the set covering problem. In: Technical Report OR-98-3, DEIS-Operations Research Group (1998)"},{"key":"9203_CR6","unstructured":"Christofides, N.: Graph theory. An algorithmic approach. Management Science, Imperial College, Academic press Inc. London Ltd., 2nd printing (1977)"},{"key":"9203_CR7","volume-title":"International Series in Operations Research & Management Science, vol. 52","author":"M Ehrgott","year":"2002","unstructured":"Ehrgott, M., Gandibleux, X.: Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys. International Series in Operations Research & Management Science, vol. 52. Springer, Heidelberg (2002)"},{"issue":"1","key":"9203_CR8","first-page":"9","volume":"334","author":"VA Emelichev","year":"1994","unstructured":"Emelichev V.A., Kravtsov, M.K.: On the nonsolvability of the discrete optimization vectors problem on the subsets systems in the class of the algorithms of linear convolution of the criteria. Doclady Mathematics 334(1), 9\u201311, (1994) (in Russian)","journal-title":"Doclady Mathematics"},{"issue":"3","key":"9203_CR9","first-page":"365","volume":"58","author":"VA Emelichev","year":"1995","unstructured":"Emelichev, V.A., Kravtsov, M.K., Yanushkevich, O.A.: Lexicographical optima of multicriteria discrete optimization problem. Matematicheskie Zametki. 58(3), 365\u2013371 (1995) (in Russian)","journal-title":"Matematicheskie Zametki."},{"issue":"2","key":"9203_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1515\/dma.1994.4.2.89","volume":"4","author":"VA Emelichev","year":"1994","unstructured":"Emelichev, V.A., Perepelitsa, V.A.: The complexity of discrete multicriteria problems. Discrete Math. Appl. 4(2), 89\u2013117 (1994)","journal-title":"Discrete Math. Appl."},{"key":"9203_CR11","first-page":"175","volume-title":"Proceedings of OR\u201998","author":"AV Eremeev","year":"1999","unstructured":"Eremeev, A.V.: A genetic algorithm with a non-binary representation for the set covering problem. In: Proceedings of OR\u201998, pp. 175\u2013181. Springer-Verlag, New York (1999)"},{"key":"9203_CR12","unstructured":"Eremeev, A.V., Kolokolov, A.A., Zaozerskaya, L.A.: A hybrid algorithm for set covering. In: Proceedings of International Workshop on Discrete Optimization Metods Design, pp. 123\u2013129. Minsk (2000)"},{"issue":"2","key":"9203_CR13","first-page":"22","volume":"7","author":"AV Eremeev","year":"2000","unstructured":"Eremeev, A.V., Zaozerskaya, L.A., Kolokolov, A.A.: A set covering problem: complexity, algoritms, experimental research. Discretnyi Analiz i Issledovanie Operatsii. 7(2), 22\u201346 (2000) (in Russian)","journal-title":"Discretnyi Analiz i Issledovanie Operatsii."},{"issue":"1","key":"9203_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 101(1), 81\u201392 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20134","key":"9203_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A.: A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the pareto memetic algorithm. Ann. Oper. Res. 131(1\u20134), 135\u2013158 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9203_CR16","unstructured":"Kitrinou, E., Kolokolov, A.A., Zaozerskaya, L.A.: The location choice for telecenters in remote areas. The case of the aegean islands. In: Proceedings of Discrete Optimization Methods in Production and Logistics (DOM-2004), pp. 61\u201365. Omsk, Nasledie Dialog-Sibir (2004)"},{"key":"9203_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-94-009-1606-7_6","volume-title":"Discrete Analysis and Operations Research","author":"AA Kolokolov","year":"1996","unstructured":"Kolokolov, A.A.: Regular partitions and cuts in integer programming. Discrete Analysis and Operations Research, pp. 59\u201379. Kluver Academic Publisher, Netherland (1996)"},{"key":"9203_CR18","first-page":"429","volume-title":"A bicriteria problem of optimal service centers location. In: Proceedings of 12th IFAC International Symposium. vol. III","author":"AA Kolokolov","year":"2006","unstructured":"Kolokolov, A.A., Zaozerskaya, L.A.: A bicriteria problem of optimal service centers location. In: Proceedings of 12th IFAC International Symposium. vol. III, pp. 429\u2013434. St. Etienne, France (2006)"},{"key":"9203_CR19","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","volume":"3","author":"C Mannino","year":"1994","unstructured":"Mannino, C., Sassano, A.: An exact algorithm for the maximum stable set problem. Comput. Optim. Appl. 3, 243\u2013258 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"9203_CR20","unstructured":"Podinovski V.V., Gavrilov, V.M.: Optimization by Consequently Applied Criteria. Sovetskoe Radio Moscow (1975) (in Russian)"},{"key":"9203_CR21","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar, M., Parada, V., Urrutia, R.: A parallel genetic algorithm to solve the set-covering problem. Comput. Oper. Res. 29, 1221\u20131235 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9203_CR22","unstructured":"Zaozerskaya, L.A. On L-class enumeration algorithm for set covering problem. In: Proc. of 11-th Baikal Intern. School-Seminar \u201cOptimization Methods and Their Applications\u201d. pp. 139\u2013142 (1998) (in Russian)"},{"key":"9203_CR23","first-page":"11","volume":"2","author":"LA Zaozerskaya","year":"2009","unstructured":"Zaozerskaya, L.A., Kolokolov, A.A.: Study and solution of bicriteria set covering problem. Problemy Informatiki. 2, 11\u201318 (2009) (in Russian)","journal-title":"Problemy Informatiki."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9203-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-012-9203-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9203-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:33Z","timestamp":1559269593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-012-9203-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9203"],"URL":"https:\/\/doi.org\/10.1007\/s10852-012-9203-7","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,1]]}}}