{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T04:40:19Z","timestamp":1721623219788},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,27]],"date-time":"2012-09-27T00:00:00Z","timestamp":1348704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11590-012-0563-8","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T16:33:40Z","timestamp":1348677220000},"page":"227-235","source":"Crossref","is-referenced-by-count":7,"title":["Robust maximum weighted independent-set problems on interval graphs"],"prefix":"10.1007","volume":"8","author":[{"given":"Fabrice","family":"Talla Nobibon","sequence":"first","affiliation":[]},{"given":"Roel","family":"Leus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,27]]},"reference":[{"key":"563_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh, I.: On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program. Ser. A 90, 263\u2013272 (2001)","journal-title":"Math. Program. Ser. A"},{"key":"563_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1016747704458","volume":"18","author":"S Basagni","year":"2001","unstructured":"Basagni, S.: Finding a maximal weighted independent set in wireless networks. Telecommun. Syst. 18, 155\u2013168 (2001)","journal-title":"Telecommun. Syst."},{"key":"563_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. Ser. B 98, 49\u201371 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"563_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"563_CR5","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the 5th British combinatorial conference, pp. 211\u2013226, University of Aberdeen, Aberdeen (1975)"},{"key":"563_CR6","first-page":"88","volume":"1","author":"F Gardi","year":"2006","unstructured":"Gardi, F.: Mutual exclusion scheduling with interval graphs or related classed: complexity and algorithms. 4OR 1, 88\u201390 (2006)","journal-title":"4OR"},{"key":"563_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Co., New York (1979)"},{"key":"563_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Info. Process. Lett. 73, 181\u2013188 (2000)","journal-title":"Info. Process. Lett."},{"key":"563_CR9","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Elsevier, Amsterdam (2004)"},{"key":"563_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Norwell (1997)"},{"key":"563_CR11","unstructured":"Mandal, S., Pal, M.: Maximum weight independent set of circular-arc graph and its application. J. Appl. Math. Comput. 22, 161\u2013174 (2006)"},{"key":"563_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1080\/00207169608804486","volume":"60","author":"M Pal","year":"1996","unstructured":"Pal, M., Bhattacharjee, G.P.: A sequential algorithm for finding a maximum weight $$k$$ -independent set on interval graphs. Int. J. Comput. Math. 60, 205\u2013214 (1996)","journal-title":"Int. J. Comput. Math."},{"key":"563_CR13","volume-title":"Stochastic programming","author":"AP Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski, A.P., Shapiro, A.: Stochastic programming. Elsevier, Amsterdam (2003)"},{"key":"563_CR14","doi-asserted-by":"crossref","first-page":"2480","DOI":"10.1016\/j.ins.2007.01.015","volume":"177","author":"A Saha","year":"2007","unstructured":"Saha, A., Pal, M., Pal, T.K.: Selection of programme slots of television channels for giving advertisement: a graph theoretic approach. Info. Sci. 177, 2480\u20132492 (2007)","journal-title":"Info. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0563-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0563-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0563-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:34Z","timestamp":1559409094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0563-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,27]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0563-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,27]]}}}