{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T13:16:08Z","timestamp":1789996568369,"version":"4.0.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T00:00:00Z","timestamp":1338508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s11704-012-2014-1","type":"journal-article","created":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T23:22:30Z","timestamp":1576452150000},"page":"264-277","source":"Crossref","is-referenced-by-count":11,"title":["Composite recommendations: from items to packages"],"prefix":"10.1007","volume":"6","author":[{"given":"Min","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter T.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,6,5]]},"reference":[{"issue":"6","key":"2014_CR1","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G. Adomavicius","year":"2005","unstructured":"Adomavicius G, Tuzhilin A. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 734\u2013749","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2014_CR2","doi-asserted-by":"crossref","unstructured":"Weng J, Lim E, Jiang J, He Q. Twitterrank: finding topic-sensitive influential twitterers. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining. 2010, 261\u2013270","DOI":"10.1145\/1718487.1718520"},{"key":"2014_CR3","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. Knapsack Problems. Berlin: Springer, 2004"},{"key":"2014_CR4","doi-asserted-by":"crossref","unstructured":"Brodsky A, Morgan Henshaw S, Whittle J. CARD: a decisionguidance framework and application for recommending composite alternatives. In: Proceedings of the 2008 ACM Conference on Recommender Systems. 2008, 171\u2013178","DOI":"10.1145\/1454008.1454037"},{"key":"2014_CR5","doi-asserted-by":"crossref","unstructured":"Koutrika G, Bercovitz B, Garcia-Molina H. FlexRecs: expressing and combining flexible recommendations. In: Proceedings of the 35th SIG-MOD International Conference on Management of Data. 2009, 745\u2013758","DOI":"10.1145\/1559845.1559923"},{"key":"2014_CR6","doi-asserted-by":"crossref","unstructured":"Angel A, Chaudhuri S, Das G, Koudas N. Ranking objects based on relationships and fixed associations. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. 2009, 910\u2013921","DOI":"10.1145\/1516360.1516464"},{"key":"2014_CR7","doi-asserted-by":"crossref","unstructured":"Parameswaran A, Garcia-Molina H. Recommendations with prerequisites. In: Proceedings of the 3rd ACM Conference on Recommender Systems. 2009, 353\u2013356","DOI":"10.1145\/1639714.1639786"},{"key":"2014_CR8","doi-asserted-by":"crossref","unstructured":"Parameswaran A, Garcia-Molina H, Ullman J. Evaluating, combining and generalizing recommendations with prerequisites. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. 2010, 919\u2013928","DOI":"10.1145\/1871437.1871555"},{"issue":"4","key":"2014_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2037661.2037665","volume":"29","author":"A. Parameswaran","year":"2011","unstructured":"Parameswaran A, Venetis P, Garcia-Molina H. Recommendation systems with complex constraints: A course recommendation perspective. ACM Transactions on Information Systems, 2011, 29(4): 1\u201333","journal-title":"ACM Transactions on Information Systems"},{"key":"2014_CR10","doi-asserted-by":"crossref","unstructured":"Lappas T, Liu K, Terzi E. Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009, 467\u2013476","DOI":"10.1145\/1557019.1557074"},{"issue":"4","key":"2014_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin R, Lotem A, Naor M. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 2003, 66(4): 614\u2013656","journal-title":"Journal of Computer and System Sciences"},{"key":"2014_CR12","doi-asserted-by":"crossref","unstructured":"Xie M, Lakshmanan L, Wood P. Breaking out of the box of recommendations: from items to packages. In: Proceedings of the 4th ACM Conference on Recommender Systems. 2010, 151\u2013158","DOI":"10.1145\/1864708.1864739"},{"key":"2014_CR13","doi-asserted-by":"crossref","unstructured":"De Choudhury M, Feldman M, Amer-Yahia S, Golbandi N, Lempel R, Yu C. Automatic construction of travel itineraries using social breadcrumbs. In: Proceedings of the 21st ACM Conference on Hypertext and Hypermedia. 2010, 35\u201344","DOI":"10.1145\/1810617.1810626"},{"key":"2014_CR14","doi-asserted-by":"crossref","unstructured":"Finger J, Polyzotis N. Robust and efficient algorithms for rank join evaluation. In: Proceedings of the 35th SIGMOD International Conference on Management of Data. 2009, 415\u2013428","DOI":"10.1145\/1559845.1559890"},{"key":"2014_CR15","doi-asserted-by":"crossref","unstructured":"Tran Q T, Chan C Y, Wang G. Evaluation of set-based queries with aggregation constraints. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management. 2011, 1495\u20131504","DOI":"10.1145\/2063576.2063791"},{"key":"2014_CR16","unstructured":"Roy S B, Amer-Yahia S, Chawla A, Das G, Yu C. Constructing and exploring composite items. In: Proceedings of the 36th SIGMOD International Conference on Management of Data. 2010, 843\u2013854"},{"key":"2014_CR17","volume-title":"Computational Complexity","author":"C. H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C H. Computational Complexity. Chichester: Wiley, 1994"},{"issue":"4","key":"2014_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra O, Kim C. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 1975, 22(4): 463\u2013468","journal-title":"Journal of the ACM"},{"key":"2014_CR19","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"1999","unstructured":"Vazirani V. Approximation Algorithms. Berlin: Springer, 1999"},{"issue":"1","key":"2014_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01585758","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela A, Vercellis C. Stochastic on-line knapsack problems. Mathematical Programming, 1995, 68(1): 73\u2013104","journal-title":"Mathematical Programming"},{"key":"2014_CR21","doi-asserted-by":"crossref","unstructured":"Kimelfeld B, Sagiv Y. Finding and approximating top-k answers in keyword proximity search. In: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. 2006, 173\u2013182","DOI":"10.1145\/1142351.1142377"},{"key":"2014_CR22","doi-asserted-by":"crossref","unstructured":"Lawler E. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 1972, 401\u2013405","DOI":"10.1287\/mnsc.18.7.401"},{"issue":"4","key":"2014_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4velin","year":"2002","unstructured":"J\u00e4velin K, Kek\u00e4l\u00e4inen J. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems, 2002, 20(4): 422\u2013446","journal-title":"ACM Transactions on Information Systems"},{"issue":"11","key":"2014_CR24","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.14778\/3402707.3402754","volume":"4","author":"M. Xie","year":"2011","unstructured":"Xie M, Lakshmanan L, Wood P. Efficient rank join with aggregation constraints. Proceedings of the VLDB Endowment, 2011, 4(11): 1201\u20131212","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2014_CR25","unstructured":"Xie M, Lakshmanan L, Wood P. Comprec-trip: a composite recommendation system for travel planning. In: Proceedings of the 27th International Conference on Data Engineering. 2011, 1352\u20131355"},{"key":"2014_CR26","unstructured":"Chekuri C, Pal M. A recursive greedy algorithm for walks in directed graphs. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. 2005, 245\u2013253"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2014-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-012-2014-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2014-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T08:44:14Z","timestamp":1613119454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-012-2014-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["2014"],"URL":"https:\/\/doi.org\/10.1007\/s11704-012-2014-1","relation":{},"ISSN":["2095-2228"],"issn-type":[{"value":"2095-2228","type":"print"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}