{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:44:19Z","timestamp":1767318259655,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819548385","type":"print"},{"value":"9789819548392","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-4839-2_6","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:39:32Z","timestamp":1767317972000},"page":"63-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Lookup Table Design Method: Achieving O(1)-Query Complexity and\u00a0No Memory Waste"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5113-6563","authenticated-orcid":false,"given":"Yu","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8643-2442","authenticated-orcid":false,"given":"Xiaoping","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"6_CR1","unstructured":"Bertsekas, D., Tsitsiklis, J.N.: Neuro-dynamic programming. Athena Sci. (1996)"},{"key":"6_CR2","unstructured":"Corneil, D., Gerstner, W., Brea, J.: Efficient model-based deep reinforcement learning with variational state tabulation. In: International Conference on Machine Learning, pp. 1049\u20131058. PMLR (2018)"},{"key":"6_CR3","unstructured":"Duan, Y., Ke, T., Wang, M.: State aggregation learning from Markov transition data. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"6_CR4","unstructured":"Jiang, N.: Notes on tabular methods (2020)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/309739.309744","volume":"30","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial algorithms: generation, enumeration, and search. ACM SIGACT News 30(1), 33\u201335 (1999)","journal-title":"ACM SIGACT News"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"DF Rogers","year":"1991","unstructured":"Rogers, D.F., Plante, R.D., Wong, R.T., Evans, J.R.: Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. 39(4), 553\u2013582 (1991)","journal-title":"Oper. Res."},{"key":"6_CR7","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/trsc.2017.0767","volume":"53","author":"MW Ulmer","year":"2019","unstructured":"Ulmer, M.W., Goodson, J.C., Mattfeld, D.C., Hennig, M.: Offline-online approximate dynamic programming for dynamic vehicle routing with stochastic requests. Transp. Sci. 53(1), 185\u2013202 (2019)","journal-title":"Transp. Sci."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1287\/trsc.2016.0719","volume":"52","author":"MW Ulmer","year":"2018","unstructured":"Ulmer, M.W., Mattfeld, D.C., K\u00f6ster, F.: Budgeting time for dynamic vehicle routing with stochastic customer requests. Transp. Sci. 52(1), 20\u201337 (2018)","journal-title":"Transp. Sci."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Wu, Y.: A dynamic and stochastic cumulative capacitated vehicle routing problem. Asia-Pac. J. Oper. Res. 2450008 (2024)","DOI":"10.1142\/S0217595924500088"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Wu, Y., Jian, M.: State aggregation and lower bound-based ADP approach for dynamic pick-up routing problem with capacity constraint. IEEE Trans. Intell. Transp. Syst. 1\u201313 (2024)","DOI":"10.1109\/TITS.2024.3357060"},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106176","volume":"154","author":"Y Wu","year":"2023","unstructured":"Wu, Y., Zeng, B.: Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach. Comput. Oper. Res. 154, 106176 (2023)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2060","DOI":"10.3390\/su11072060","volume":"11","author":"Y Wu","year":"2019","unstructured":"Wu, Y., Zeng, B., Huang, S.: A dynamic strategy for home pick-up service with uncertain customer requests and its implementation. Sustainability 11(7), 2060 (2019)","journal-title":"Sustainability"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zeng, B., Jian, M.: ADP-and rollout-based dynamic vehicle routing for pick-up service via budgeting capacity. Flexible Serv. Manuf. J. 1\u201345 (2024)","DOI":"10.1007\/s10696-024-09551-z"},{"key":"6_CR15","unstructured":"Yin, M., Wang, Y.X.: Asymptotically efficient off-policy evaluation for tabular reinforcement learning. In: International Conference on Artificial Intelligence and Statistics, pp. 3948\u20133958. PMLR (2020)"},{"key":"6_CR16","unstructured":"Zhou, Z., Zhou, Z., Bai, Q., Qiu, L., Blanchet, J., Glynn, P.: Finite-sample regret bound for distributionally robust offline tabular reinforcement learning. In: International Conference on Artificial Intelligence and Statistics, pp. 3331\u20133339. PMLR (2021)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-4839-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T01:39:34Z","timestamp":1767317974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-4839-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819548385","9789819548392"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-4839-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.maths.sdnu.edu.cn\/TAMC2025.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}