{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:53Z","timestamp":1759847213315},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,3,23]],"date-time":"2006-03-23T00:00:00Z","timestamp":1143072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s10589-005-3913-y","type":"journal-article","created":{"date-parts":[[2006,3,24]],"date-time":"2006-03-24T14:46:53Z","timestamp":1143211613000},"page":"377-407","source":"Crossref","is-referenced-by-count":6,"title":["Polyhedral Analysis for Concentrator Location Problems"],"prefix":"10.1007","volume":"34","author":[{"given":"Martine","family":"Labb\u00e9","sequence":"first","affiliation":[]},{"given":"Hande","family":"Yaman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,23]]},"reference":[{"key":"3913_CR1","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1287\/moor.20.3.562","volume":"20","author":"K. Aardal","year":"1995","unstructured":"K. Aardal, Y. Pochet, and L.A. Wolsey, \u201cCapacitated facility location: Valid inequalities and facets,\u201d Mathematics of Operations Research, vol. 20, pp. 562\u2013582, 1995.","journal-title":"Mathematics of Operations Research"},{"key":"3913_CR2","first-page":"149","volume":"81","author":"K. Aardal","year":"1998","unstructured":"K. Aardal, \u201cCapacitated facility location: Separation algorithms and computational experience,\u201d Mathematical Programming, vol. 81, pp. 149\u2013175, 1998.","journal-title":"Mathematical Programming"},{"key":"3913_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"P. Avella","year":"2001","unstructured":"P. Avella and A. Sassano, \u201cOn the p-median polytope,\u201d Mathematical Programming, vol. 89, pp. 395\u2013411, 2001.","journal-title":"Mathematical Programming"},{"key":"3913_CR4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas, \u201cFacets of the Knapsack Polytope,\u201d Mathematical Programming, vol. 8, pp. 146\u2013164, 1975.","journal-title":"Mathematical Programming"},{"key":"3913_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591796","volume":"30","author":"E. Balas","year":"1984","unstructured":"E. Balas and J.B. Mazzola, \u201cNonlinear 0-1 Programming: I. Linearization Techniques,\u201d Mathematical Programming, vol. 30, pp. 1\u201321, 1984.","journal-title":"Mathematical Programming"},{"key":"3913_CR6","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, \u201cOR-Library: distributing test problems by electronic mail,\u201d Journal of the Operational Research Society, vol. 41, pp. 1069\u20131072, 1990.","journal-title":"Journal of the Operational Research Society"},{"key":"3913_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/net.20020","volume":"44","author":"G. Carello","year":"2004","unstructured":"G. Carello, F. Della Croce, M. Ghirardi, and R. Tadei, \u201cSolving hub location problem in telecommunication network design: A local search approach,\u201d Networks, vol. 44, pp. 94\u2013105, 2004.","journal-title":"Networks"},{"key":"3913_CR8","unstructured":"Th. Christof, Ein Verfharen zur Transformation Zwischen Polyederdarstellungen, Diplomarbeit, Universit\u00e4t Augsburg, 1991."},{"key":"3913_CR9","unstructured":"Q. Deng and D. Simchi-Levi, \u201cValid inequalities, facets and computational results for the capacitated concentrator location problem,\u201d Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027\u20136699, 1992."},{"key":"3913_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979."},{"key":"3913_CR11","doi-asserted-by":"crossref","unstructured":"E. Gourdin, M. Labb\u00e9, and H. Yaman, Telecommunication and Location. In Facility Location: Applications and Theory, Z.Drezner and H.W. Hamacher (Eds.), Springer, pp. 275\u2013305, 2002.","DOI":"10.1007\/978-3-642-56082-8_9"},{"key":"3913_CR12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Z. Gu, G.L. Nemhauser and M.W.P. Savelsbergh, \u201cCover Inequalities for 0-1 Linear Programs: Computation,\u201d INFORMS Journal on Computing, vol. 10, pp. 427\u2013437, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"3913_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"P.L. Hammer, E.L. Johnson, and U.N. Peled, \u201cFacets of Regular 0-1 Polytopes,\u201d Mathematical Programming, vol. 8, pp. 179\u2013206, 1975.","journal-title":"Mathematical Programming"},{"key":"3913_CR14","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":"M. J\u00fanger","year":"2000","unstructured":"M. J\u00fanger and S. Thienel, \u201cThe ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization,\u201d Softw. Pract. Experience, vol. 30, pp. 1325\u20131352, 2000.","journal-title":"Softw. Pract. Experience"},{"key":"3913_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-004-0531-x","volume":"102","author":"M. Labb\u00e9","year":"2005","unstructured":"M. Labb\u00e9, H. Yaman, and E. Gourdin, \u201cA branch and cut algorithm for hub location problems with single assignment,\u201d Mathematical Programming, vol. 102, pp. 371\u2013405, 2005.","journal-title":"Mathematical Programming"},{"key":"3913_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01587093","volume":"44","author":"J.M.Y. Leung","year":"1989","unstructured":"J.M.Y. Leung and T.L. Magnanti, \u201cValid inequalities and facets of the capacitated plant location problem,\u201d Mathematical Programming, vol. 44, pp. 271\u2013291, 1989.","journal-title":"Mathematical Programming"},{"key":"3913_CR17","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, 1990."},{"key":"3913_CR18","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988."},{"key":"3913_CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, \u201cOn the facial structure of set packing polyhedra,\u201d Mathematical Programming, vol. 5, pp. 199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"3913_CR20","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L. Wolsey","year":"1975","unstructured":"L. Wolsey, \u201cFaces for a linear inequality in 0-1 variables,\u201d Mathematical Programming, vol. 8, pp. 165\u2013178, 1975.","journal-title":"Mathematical Programming"},{"key":"3913_CR21","doi-asserted-by":"crossref","unstructured":"H. Yaman, Concentrator Location in Telecommunications Networks, Springer, 2005.","DOI":"10.1007\/s10288-003-0030-6"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3913-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3913-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3913-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:29Z","timestamp":1559302589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3913-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,23]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["3913"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3913-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,23]]}}}