{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:06:12Z","timestamp":1648908372303},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T00:00:00Z","timestamp":1161043200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,11,29]]},"DOI":"10.1007\/s10288-006-0025-1","type":"journal-article","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T05:39:20Z","timestamp":1161063560000},"page":"319-333","source":"Crossref","is-referenced-by-count":2,"title":["Combinatorial optimization problems in wireless switch design"],"prefix":"10.1007","volume":"5","author":[{"given":"Renaud","family":"Sirdey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,17]]},"reference":[{"key":"25_CR1","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows. Theory, algorithms and applications. Prentice Hall, Englewood Clipts"},{"key":"25_CR2","volume-title":"Fair representation: meeting the ideal of one man, one vote","author":"ML Balinski","year":"2001","unstructured":"Balinski ML, Young HP (2001) Fair representation: meeting the ideal of one man, one vote, 2nd edn. Brookings Institution Press, Washington","edition":"2"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P Dell\u2019Olmo","year":"1998","unstructured":"Dell\u2019Olmo P, Kellerer H, Speranza MG, Tuza Z (1998). A $$\\frac{13}{12}$$ approximation algorithm for bin packing with extendable bins. Inf Process Lett 65:229\u2013233","journal-title":"Inf Process Lett"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","volume":"94","author":"P Dell\u2019Olmo","year":"1999","unstructured":"Dell\u2019Olmo P, Speranza MG (1999) Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Appl Math 94:181\u2013191","journal-title":"Discrete Appl Math"},{"key":"25_CR5","volume-title":"Computers and intractability-a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability-a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco"},{"key":"25_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization. Algorithms and combinatorics, Vol 2","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Algorithms and combinatorics, Vol 2. Springer, Berlin Heidelberg New York"},{"issue":"2","key":"25_CR7","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/322003.322010","volume":"24","author":"T Ibaraki","year":"1977","unstructured":"Ibaraki T (1977) The power of dominance relations in branch-and-bound algorithms. J ACM 24(2):264\u2013279","journal-title":"J ACM"},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin Heidelberg New York"},{"key":"25_CR9","unstructured":"Knuth DE (1998) Sorting and searching. The art of computer programming, Vol 3, 2nd edn. Addison-Wesley, Reading"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Korte B, Vygen J (2000) Combinatorial optimization\u2014theory and algorithms. Algorithms and combinatorics, Vol 21. Springer, Berlin Heidelberg New York","DOI":"10.1007\/978-3-662-21708-5"},{"key":"25_CR11","unstructured":"Lagrange X, Godlewski P, Tabbane S (2000) R\u00e9seaux GSM, des principes \u00e0 la norme. R\u00e9seaux et t\u00e9l\u00e9communications, cinqui\u00e8me edition. Herm\u00e8s Science Publications"},{"key":"25_CR12","unstructured":"Minoux M (1983) Programmation math\u00e9matique. Th\u00e9orie et\u00a0algorithmes (tome 2). Collection Technique et Scientifique des T\u00e9l\u00e9communications, Dunod"},{"key":"25_CR13","volume-title":"The GSM system for mobile commnunications\u2014a comprehensive overview of the European Digital Cellular Systems","author":"M Mouly","year":"1992","unstructured":"Mouly M, Pautet M-B (1992) The GSM system for mobile commnunications\u2014a comprehensive overview of the European Digital Cellular Systems. Telecom Publishing, Olympia"},{"key":"25_CR14","volume-title":"Combinatorial optimization\u2014polyhedra and efficiency Algorithms and combinatorics, Vol 24","author":"A Schrijver","year":"2004","unstructured":"Schrijver A (2004) Combinatorial optimization\u2014polyhedra and efficiency Algorithms and combinatorics, Vol 24. Springer, Berlin Heidelberg New York"},{"key":"25_CR15","unstructured":"Sirdey R (2005) BSC software engineering guidlines. Technical report PE\/BSC\/APP\/16486 V01\/EN, Service d\u2019architecture BSC, Nortel GSM Access R&D"},{"key":"25_CR16","unstructured":"Sirdey R, Carlier J, Kerivin H, Nace D (2005) On a resource-constrained scheduling problem with application to distributed systems reconfiguration. Technical report PE\/BSC\/INF\/015593 V01\/EN, Service d\u2019architecture BSC, Nortel GSM Access R&D, France (submitted to the European Journal of Operational Research)"},{"key":"25_CR17","unstructured":"Sirdey R, Plainfoss\u00e9 D, Gauthier J-P (2003) A practical approach to combinatorial optimization problems encountered in the design of a high availability distributed system. In: Proceedings of INOC, pp 532\u2013539"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/opre.44.2.407","volume":"44","author":"G Yu","year":"1996","unstructured":"Yu G (1996) On the max\u2013min 0-1 knapsack problem with robust optimization applications. Oper Res 44:407\u2013415","journal-title":"Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0025-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0025-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0025-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0025-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,17]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,29]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0025-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,17]]}}}