{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:43:04Z","timestamp":1776793384600,"version":"3.51.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2004,7,7]],"date-time":"2004-07-07T00:00:00Z","timestamp":1089158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10107-004-0531-x","type":"journal-article","created":{"date-parts":[[2004,7,7]],"date-time":"2004-07-07T07:56:11Z","timestamp":1089186971000},"page":"371-405","source":"Crossref","is-referenced-by-count":107,"title":["A branch and cut algorithm for hub location problems with single assignment"],"prefix":"10.1007","volume":"102","author":[{"given":"Martine","family":"Labb\ufffd","sequence":"first","affiliation":[]},{"given":"Hande","family":"Yaman","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Gourdin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,7,7]]},"reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","volume":"20","author":"Aardal","year":"1995","unstructured":"Aardal, K., Pochet, Y., Wolsey, L.A.: Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20, 562?582 (1995)","journal-title":"Math. Oper. Res."},{"key":"CR2","first-page":"149","volume":"81","author":"Aardal","year":"1998","unstructured":"Aardal, K.: Capacitated Facility Location: Separation Algorithms and Computational Experience. Math. Program. 81, 149?175 (1998)","journal-title":"Math. Program."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00453-002-0968-3","volume":"34","author":"Andrews","year":"2002","unstructured":"Andrews, M., Zhang, L.: Approximation Algorithms for Access Network Design. Algorithmica 34, 197?215 (2002)","journal-title":"Algorithmica"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"Avella","year":"2001","unstructured":"Avella, P., Sassano, A.: On the p-Median Polytope. Math. Program. 89, 395?411 (2001)","journal-title":"Math. Program."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"Balas","year":"1975","unstructured":"Balas, E.: Facets of the Knapsack Polytope. Math. Program. 8, 146?164 (1975)","journal-title":"Math. Program."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"Beasley","year":"1990","unstructured":"Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069?1072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Campbell, J.F., Ernst, A.T., Krishnamoorthy, M.: Hub Location Problems. In: Facility Location: Applications and Theory, Z. Drezner, H.W. Hamacher (eds.), Springer, 2002, pp. 373?407","DOI":"10.1007\/978-3-642-56082-8_12"},{"key":"CR8","unstructured":"Dantzig, G.B.: On the Significance of Solving Linear Programming Problems with Some Integer Variables. The Rand Corporation, document, 1958, p. 1486"},{"key":"CR9","unstructured":"Deng, Q., Simchi-Levi, D.: Valid Inequalities, Facets and Computational Results for the Capacitated Concentrator Location Problem. Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027-6699, 1992"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","volume":"86","author":"Ernst","year":"1999","unstructured":"Ernst, A.T., Krishnamoorthy, M.: Solution Algorithms for the Capacitated Single Allocation Hub Location Problem. Ann. Oper. Res. 86, 141?159 (1999)","journal-title":"Ann. Oper. Res."},{"key":"CR11","unstructured":"Gourdin, E., Labb\u00e9, M., Yaman, H.: Telecommunication and Location. In: Facility Location: Applications and Theory, Z. Drezner, H.W. Hamacher (eds.), Springer, 2003, pp. 275?305"},{"key":"CR12","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum (ed.), PWS Publishing Company, 1997, pp. 144?191"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988","DOI":"10.1007\/978-3-642-97881-4"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Gu","year":"1998","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Cover Inequalities for 0-1 Linear Programs: Computation. INFORMS J. Comput. 10, 427?437 (1998)","journal-title":"INFORMS J. Comput."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of Regular 0-1 Polytopes. Math. Program. 8, 179?206 (1975)","journal-title":"Math. Program."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Experience 30, 1325?1352 (2000)","journal-title":"Softw. Pract. Experience"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01587093","volume":"44","author":"Leung","year":"1989","unstructured":"Leung, J.M.Y., Magnanti, T.L.: Valid Inequalities and Facets of the Capacitated Plant Location Problem. Math. Program. 44, 271?291 (1989)","journal-title":"Math. Program."},{"key":"CR18","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"Padberg","year":"1973","unstructured":"Padberg, M.W.: On the Facial Structure of Set Packing Polyhedra. Math. Program. 5, 199?215 (1973)","journal-title":"Math. Program."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/0377-2217(95)00100-X","volume":"94","author":"Skorin-Kapov","year":"1996","unstructured":"Skorin-Kapov, D., Skorin-Kapov, J., O?Kelly, M.: Tight linear programming relaxations of uncapacitated p-hub median problem. Eur. J. Oper. Res. 94, 582?593 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Swamy, C., Kumar, A.: Primal-dual Algorithms for Connected Facility Location Problems. In: Approximation algorithms for combinatorial optimization, K. Jansen, S. Leonardi, V. Vazirani (eds.), 5th international workshop, APPROX 2002, Proceedings. Lect. Notes Comput. Sci. 2462, Springer, Berlin, 2002 pp. 256?269","DOI":"10.1007\/3-540-45753-4_22"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"Wolsey","year":"1975","unstructured":"Wolsey, L.: Faces for a Linear Inequality in 0-1 Variables. Math. Program. 8, 165?178 (1975)","journal-title":"Math. Program."},{"key":"CR23","unstructured":"Yaman, H.: Concentrator Location in Telecommunication Networks, Ph.D. Thesis, Universit\u00e9 Libre de Bruxelles, 2002. Available at http:\/\/smg.ulb.ac.be\/"},{"key":"CR24","unstructured":"Yuan, D.: An Annotated Bibliography in Communication Network Design and Routing. In: Optimization Models and Methods for Communication Network Design and Routing. Ph.D. Thesis, Department of Mathematics, Link\u00f6ping University, Sweden, 2001"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0531-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0531-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0531-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:57Z","timestamp":1559108997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0531-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,7]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0531-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,7,7]]}}}