{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:56:53Z","timestamp":1648587413455},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T00:00:00Z","timestamp":1181001600000},"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":[[2008,6]]},"DOI":"10.1007\/s10288-007-0048-2","type":"journal-article","created":{"date-parts":[[2007,6,4]],"date-time":"2007-06-04T06:46:47Z","timestamp":1180939607000},"page":"195-198","source":"Crossref","is-referenced-by-count":0,"title":["Models and algorithms for the reconfiguration of distributed wireless switching systems"],"prefix":"10.1007","volume":"6","author":[{"given":"Renaud","family":"Sirdey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,5]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S1389-1286(03)00189-0","volume":"42","author":"BG J\u00f3zsa","year":"2003","unstructured":"J\u00f3zsa BG, Makai M (2003) On the solution of reroute sequence planning problem in MPLS networks. Comput Networks 42:199\u2013210","journal-title":"Comput Networks"},{"key":"48_CR2","unstructured":"Kerivin H, Sirdey R (2007) Polyhedral combinatorics of a resource-constrained ordering problem part II: on the process move program polytope. Technical Report PE\/BSC\/INF\/017913 V01\/EN, Service d\u2019architecture BSC, Nortel GSM Access R&D, France (submitted for publication)"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Sirdey R (2007) Combinatorial optimization problems in wireless switch design. 4OR (in press)","DOI":"10.1007\/s10288-006-0025-1"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Sirdey R, Kerivin H (2006) A branch-and-cut algorithm for a resource-constrained scheduling problem. RAIRO\u2014Oper Res (in press)","DOI":"10.1051\/ro:2007021"},{"key":"48_CR5","unstructured":"Sirdey R, Kerivin H (2007) Polyhedral combinatorics of a resource-constrained ordering problem part I: on the partial linear ordering polytope. Technical Report PE\/BSC\/INF\/017912 V01\/EN, Service d\u2019architecture BSC, Nortel GSM Access R&D, France (submitted for publication)"},{"key":"48_CR6","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":"48_CR7","unstructured":"Sirdey R, Carlier J, Kerivin H, Nace D (2005) On a resource-constrained scheduling problem with application to distributed systems reconfiguration. Eur J Oper Res (in press)"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Sirdey R, Carlier J, Nace D (2006) Approximate resolution of a resource-constrained scheduling problem. J Heuristics (in press)","DOI":"10.1007\/s10732-007-9052-0"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0048-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0048-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0048-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:55Z","timestamp":1559131975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0048-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,5]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0048-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,5]]}}}