{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:46:16Z","timestamp":1743007576377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228877"},{"type":"electronic","value":"9783319228884"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22888-4_39","type":"book-chapter","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T07:06:08Z","timestamp":1439535968000},"page":"498-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic-Oriented Decision Support System for Group Interview Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Sihem Ben","family":"Jouida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cor.2007.09.009","volume":"36","author":"C Bazgan","year":"2009","unstructured":"Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0\u20131 multi-objective knapsack problem. Comput. Oper. Res. 36(1), 260\u2013279 (2009)","journal-title":"Comput. Oper. Res."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D.: A knapsack secretary problem with applications. In: APPROX 2007 (2007)","DOI":"10.1007\/978-3-540-74208-1_2"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0377-2217(94)90123-6","volume":"78","author":"YH Chun","year":"1994","unstructured":"Chun, Y.H., Moskowitz, H., Plante, R.D.: Dynamic programming formulation of the group interview problem with a general utility function. Eur. J. Oper. Res. 78(1), 81\u201392 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"AJ Kleywegt","year":"1998","unstructured":"Kleywegt, A.J., Papastavrou, J.D.: The dynamic and stochastic knapsack problem. Oper. Res. 46, 17\u201335 (1998)","journal-title":"Oper. Res."},{"key":"39_CR5","first-page":"238","volume":"150","author":"EB Dynkin","year":"1963","unstructured":"Dynkin, E.B.: Optimal choice of the stopping moment of a markov process. Dokl. Akad. Nauk. SSSR 150, 238\u2013240 (1963)","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"DV Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. Appl. Stat. 10, 39\u201351 (1961)","journal-title":"Appl. Stat."},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1016\/S0305-0548(00)00047-2","volume":"28","author":"YH Chun","year":"2001","unstructured":"Chun, Y.H.: Optimal partitioning of groups in selecting the best choice. Comput. Oper. Res. 28, 1367\u20131386 (2001)","journal-title":"Comput. Oper. Res."},{"issue":"313","key":"39_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"JP Gilbert","year":"1966","unstructured":"Gilbert, J.P., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35\u201373 (1966)","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Lecture Notes in Computer Science","Augmented and Virtual Reality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22888-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:45:52Z","timestamp":1674567952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22888-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228877","9783319228884"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22888-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}