{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:21Z","timestamp":1759847361770},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261520"},{"type":"electronic","value":"9783540322641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11493853_5","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T03:35:25Z","timestamp":1279078525000},"page":"34-48","source":"Crossref","is-referenced-by-count":22,"title":["The Temporal Knapsack Problem and Its Solution"],"prefix":"10.1007","author":[{"given":"Mark","family":"Bartlett","sequence":"first","affiliation":[]},{"given":"Alan M.","family":"Frisch","sequence":"additional","affiliation":[]},{"given":"Youssef","family":"Hamadi","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[]},{"given":"S. Armagan","family":"Tarim","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Unsworth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I. Foster","year":"2001","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling scalable virtual organization. The International Journal of High Performance Computing Applications\u00a015, 200\u2013222 (2001)","journal-title":"The International Journal of High Performance Computing Applications"},{"unstructured":"Roy, A., Sander, V.: Advanced reservation API. GFD-E5, Scheduling Working Group, Global Grid Forum, GGF (2003)","key":"5_CR2"},{"doi-asserted-by":"crossref","unstructured":"Foster, I., Kesselman, C., Nick, J., Tuecke, S.: The physiology of the grid: An open grid services architecture for distributed systems integration (2002)","key":"5_CR3","DOI":"10.1109\/MC.2002.1009167"},{"key":"5_CR4","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A. Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A.: The multidimensional 0-1 knapsack problem: An overview. European Journal of Operational Research\u00a0155, 1\u201321 (2004)","journal-title":"European Journal of Operational Research"},{"key":"5_CR6","first-page":"1","volume-title":"Proc. of the Fifteenth European Conf. on Artificial Intelligence","author":"T. Walsh","year":"2002","unstructured":"Walsh, T.: Stochastic constraint programming. In: Proc. of the Fifteenth European Conf. on Artificial Intelligence, pp. 1\u20135. IOS Press, Amsterdam (2002)"},{"unstructured":"Marinescu, R., Dechter, R.: AND\/OR tree search for constraint optimization. In: Proc. of the 6th International Workshop on Preferences and Soft Constraints (2004)","key":"5_CR7"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(70)90002-0","volume":"1","author":"Z. Manna","year":"1970","unstructured":"Manna, Z.: The correctness of nondeterministic programs. Artificial Intelligence\u00a01, 1\u201326 (1970)","journal-title":"Artificial Intelligence"},{"unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga (1980)","key":"5_CR9"},{"unstructured":"Martelli, A., Montanari, U.: Additive AND\/OR graphs. In: Proc. of the Fourth Int. Joint Conf. on Artificial Intelligence, pp. 345\u2013350 (1975)","key":"5_CR10"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0004-3702(71)90006-3","volume":"2","author":"C.L. Chang","year":"1971","unstructured":"Chang, C.L., Slagle, J.: An admissible and optimal algorithm for searching AND\/OR graphs. Artificial Intelligence\u00a02, 117\u2013128 (1971)","journal-title":"Artificial Intelligence"},{"key":"5_CR12","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"Chvatal, V.: Linear Programming. W.H. Freeman, New York (1983)"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization: Methods, Theory, and Applications","author":"R.E. Bixby","year":"2000","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice \u2014 closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization: Methods, Theory, and Applications, pp. 19\u201349. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"5_CR14","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley and Sons, New York (1998)"},{"unstructured":"Oliva, C., Michelon, P., Artigues, C.: Constraint and linear programming: Using reduced costs for solving the zero\/one multiple knapsack problem. In: Proc. of the Workshop on Cooperative Solvers in Constraint Programming (CoSolv 2001), Paphos, Cyprus, pp. 87\u201398 (2001)","key":"5_CR15"},{"key":"5_CR16","first-page":"1","volume-title":"Proc. of the Tenth European Conf. on Artificial Intelligence","author":"S.J. Russell","year":"1992","unstructured":"Russell, S.J.: Efficient memory-bounded search methods. In: Proc. of the Tenth European Conf. on Artificial Intelligence, Vienna, pp. 1\u20135. Wiley, Chichester (1992)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11493853_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:55Z","timestamp":1605625135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11493853_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261520","9783540322641"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11493853_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}