{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:38:29Z","timestamp":1649198309359},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,4,22]],"date-time":"2008-04-22T00:00:00Z","timestamp":1208822400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10288-008-0074-8","type":"journal-article","created":{"date-parts":[[2008,4,21]],"date-time":"2008-04-21T07:28:29Z","timestamp":1208762909000},"page":"105-108","source":"Crossref","is-referenced-by-count":4,"title":["Multicast problems in telecommunication networks"],"prefix":"10.1007","volume":"7","author":[{"given":"Valeria","family":"Leggieri","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,4,22]]},"reference":[{"key":"74_CR1","unstructured":"Leggieri V, Haouari M, Layeb S, Triki C (2007) The Steiner Tree problem with delays: a tight compact formulation and reduction procedures. Technical report no. 13\/2007"},{"key":"74_CR2","author":"V Leggieri","year":"2008","unstructured":"Leggieri V, Nobili P, Triki C (2008) Minimum power multicasting problem in wireless networks. Math Methods Oper Res. doi: 10.1007\/s00186-008-0222-0","journal-title":"Math Methods Oper Res"},{"key":"74_CR3","author":"R Montemanni","year":"2008","unstructured":"Montemanni R, Leggieri V, Triki C (2008) Mixed integer formulations for the probabilistic minimum energy broadcast in wireless networks. Eur J Oper Res. doi: 10.1016\/j.ejor.2007.06.031","journal-title":"Eur J Oper Res"},{"key":"74_CR4","doi-asserted-by":"crossref","first-page":"1953","DOI":"10.1016\/j.cor.2003.12.007","volume":"32","author":"CAS Oliveira","year":"2005","unstructured":"Oliveira CAS, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comput Oper Res 32: 1953\u20131981","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0074-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-008-0074-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0074-8","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-008-0074-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,22]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["74"],"URL":"https:\/\/doi.org\/10.1007\/s10288-008-0074-8","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,22]]}}}