{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:23:03Z","timestamp":1773735783768,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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":["Comput. Math. and Math. Phys."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1134\/s0965542509060098","type":"journal-article","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T03:19:50Z","timestamp":1245295190000},"page":"1010-1020","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["New lower bounds for the facility location problem with clients\u2019 preferences"],"prefix":"10.1134","volume":"49","author":[{"given":"I. L.","family":"Vasil\u2019ev","sequence":"first","affiliation":[]},{"given":"K. B.","family":"Klimentova","sequence":"additional","affiliation":[]},{"given":"Yu. A.","family":"Kochetov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2009,6,19]]},"reference":[{"key":"6009_CR1","volume-title":"Discrete Location Problems and Polynomials of Boolean Variables","author":"V. L. Beresnev","year":"2005","unstructured":"V. L. Beresnev, Discrete Location Problems and Polynomials of Boolean Variables (Institut matematiki, SO RAN, Novosibirsk, 2005) [in Russian]."},{"key":"6009_CR2","volume-title":"Polynomially Solvable and NP-Hard Standardization Problems","author":"L. E. Gorbachevskaya","year":"1998","unstructured":"L. E. Gorbachevskaya, Polynomially Solvable and NP-Hard Standardization Problems, Candidate\u2019s Dissertation in Mathematics and Physics (IM SO RAN, Novosibirsk, 1998)."},{"key":"6009_CR3","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 Clients\u2019 Preference Orderings,\u201d Regional Sci. Urban Econom. 17, 451\u2013473 (1987).","journal-title":"Regional Sci. Urban Econom."},{"issue":"2","key":"6009_CR4","first-page":"3","volume":"6","author":"L. E. Gorbachevskaya","year":"1999","unstructured":"L. E. Gorbachevskaya, V. T. Dement\u2019ev, and Yu. V. Shamardin, \u201cBilevel Standartization Problem with the Uniqueness of the Optimal Consumer Choice,\u201d Diskretnyi Analiz Issl. Operatsii, Ser. 2, 6(2), 3\u201311 (1999).","journal-title":"Diskretnyi Analiz Issl. Operatsii, Ser. 2"},{"key":"6009_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, et al., Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Springer, Berlin, 1999)."},{"key":"6009_CR6","unstructured":"P. Hansen, Y. Kochetov, and N. Mladenovic, \u201cLower Bounds for the Uncapacitated Facility Location Problem with User Preferences,\u201d Technical Report, Les Cahiers du GERAD, G-2004-24 (2004)."},{"key":"6009_CR7","unstructured":"P. Hansen, Y. Kochetov, and N. Mladenovic, \u201cThe Uncapacitated Facility Location Problem with User Preferences,\u201d in Proc. DOM\u20192004 Workshop, Omsk-Irkutsk, 2004, pp. 50\u201355."},{"issue":"1","key":"6009_CR8","first-page":"3","volume":"14","author":"E. V. Alekseeva","year":"2007","unstructured":"E. V. Alekseeva and Yu. A. Kochetov, \u201cGenetic Local Search for the p-Median Problem with Client\u2019s Preferences,\u201d Diskretnyi Analiz Issl. Operatsii, Ser. 2, 14(1), 3\u201331 (2007).","journal-title":"Diskretnyi Analiz Issl. Operatsii, Ser. 2"},{"issue":"2","key":"6009_CR9","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. Garc\u00eda, M. Labb\u00e9, and A. Mar\u00edn, \u201cA Strengthened Formulation for the Simple Plant Location Problem with Order,\u201d Operat. Res. Letts. 35(2), 141\u2013150 (2007).","journal-title":"Operat. Res. Letts."},{"key":"6009_CR10","doi-asserted-by":"crossref","unstructured":"A. V. Kononov, Yu. A. Kochetov, and A. V. Plyasunov, \u201cCompetitive Facility Location Models,\u201d Zh. Vychisl. Mat. Mat. Fiz. 49(6) (2009) [Comput. Math. Math. Phys. 49 (6), (2009)].","DOI":"10.1134\/S0965542509060086"},{"key":"6009_CR11","volume-title":"Integer and Combinatiorial Optimization","author":"G. N. Nemhauser","year":"1999","unstructured":"G. N. Nemhauser and L. A. Wolsey, Integer and Combinatiorial Optimization (Wiley-Interscience, Chichester, 1999)."},{"key":"6009_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"M. W. Padberg, \u201cOn the Facial Structure of the Set Packing Polyhedra,\u201d Math. Program. 5, 199\u2013215 (1973).","journal-title":"Math. Program."},{"key":"6009_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, Berlin, 2006)."},{"key":"6009_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P. Avella","year":"2005","unstructured":"P. Avella and I. A. Vasil\u2019ev, \u201cA Computational Study of a Cutting Plane Algorithm for University Course Timetabling,\u201d J. Scheduling 8, 497\u2013514 (2005).","journal-title":"J. Scheduling"},{"key":"6009_CR15","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1287\/mnsc.39.6.657","volume":"39","author":"K. L. Hoffman","year":"1993","unstructured":"K. L. Hoffman and M. Padberg, \u201cSolving Airline Crew Scheduling Problems by Branch-and-Cut,\u201d Management Sci. 39, 657\u2013682 (1993).","journal-title":"Management Sci."},{"key":"6009_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/PL00011381","volume":"88","author":"R. Borndorfer","year":"2000","unstructured":"R. Borndorfer and R. Weismantel, \u201cSet Packing Relaxations of Some Integer Programs,\u201d Math. Program. 88, 425\u2013450 (2000).","journal-title":"Math. Program."},{"key":"6009_CR17","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-002-0335-9","volume":"93","author":"H. Waterer","year":"2002","unstructured":"H. Waterer, E. L. Johnson, P. Nobili, and M. W. P. Savelsbergh, \u201cThe Relation of Time Indexed Formulations of Single Machine Scheduling Problems to the Node Packing Problem,\u201d Math. Program. 93, 477\u2013494 (2002).","journal-title":"Math. Program."},{"key":"6009_CR18","first-page":"389","volume":"77","author":"E. Cheng","year":"1997","unstructured":"E. Cheng and W. Y. Cunninghav, \u201cWheel Inequalities for Stable Set Polytopes,\u201d Math. Program. 77, 389\u2013421 (1997).","journal-title":"Math. Program."},{"key":"6009_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s101070100267","volume":"92","author":"E. Cheng","year":"2002","unstructured":"E. Cheng and S. Vries, \u201cAntiweb-Wheel Inequalities and Their Separation Problems Over the Stable Set Polytopes,\u201d Math. Program. 92, 153\u2013175 (2002).","journal-title":"Math. Program."},{"key":"6009_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0167-6377(00)00060-2","volume":"28","author":"F. Rossi","year":"2001","unstructured":"F. Rossi and S. Smriglio, \u201cA Branch-and-Cut Algorithm for the Maximum Cardinality Stable Set Problem,\u201d Operat. Res. Letts. 28, 63\u201374 (2001).","journal-title":"Operat. Res. Letts."},{"key":"6009_CR21","volume-title":"Combinatorial Methods and Algorithms for Solving Large-Scale Discrete Optimization Problems","author":"V. R. Khachaturov","year":"2000","unstructured":"V. R. Khachaturov, V. E. Veselovskii, A. V. Zlotov, et al., Combinatorial Methods and Algorithms for Solving Large-Scale Discrete Optimization Problems (Nauka, Moscow, 2000) [in Russian]."}],"container-title":["Computational Mathematics and Mathematical Physics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0965542509060098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0965542509060098","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0965542509060098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0965542509060098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T06:15:13Z","timestamp":1773728113000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0965542509060098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["6009"],"URL":"https:\/\/doi.org\/10.1134\/s0965542509060098","relation":{},"ISSN":["0965-5425","1555-6662"],"issn-type":[{"value":"0965-5425","type":"print"},{"value":"1555-6662","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]},"assertion":[{"value":"12 March 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2009","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}