{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:50:07Z","timestamp":1777503007064,"version":"3.51.4"},"reference-count":18,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"vor","delay-in-days":20,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071417"],"award-info":[{"award-number":["12071417"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,12,28]]},"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:p>In this paper, we consider the integrated path and bin packing problem, which to use the minimum number of unit-size bins to packing the arcs on the path between two specific vertices in a given directed graph. We propose a 3\/2-approximation algorithm and an asymptotic polynomial time approximation scheme.<\/jats:p>","DOI":"10.1051\/ro\/2024232","type":"journal-article","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T19:43:12Z","timestamp":1735674192000},"page":"325-333","source":"Crossref","is-referenced-by-count":3,"title":["Approximation algorithms for the integrated path and bin packing problem"],"prefix":"10.1051","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqing","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"Alon","year":"1998","journal-title":"J. Sched."},{"key":"R2","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-009-0307-4","volume":"128","author":"Berger","year":"2011","journal-title":"Math. Prog."},{"key":"R3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"D\u00f3sa","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1007\/s00453-015-9992-y","volume":"74","author":"Epstein","year":"2016","journal-title":"Algorithmica"},{"key":"R5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"de La Vega","year":"1981","journal-title":"Combinatorica"},{"key":"R6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1007\/s10878-019-00406-0","volume":"38","author":"Guan","year":"2019","journal-title":"J. Comb. Optim."},{"key":"R7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"key":"R8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"Hassin","year":"2004","journal-title":"SIAM J. Comput."},{"key":"R9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"key":"R10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00186-017-0604-2","volume":"87","author":"Holzhauser","year":"2018","journal-title":"Math. Methods Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ipl.2017.06.003","volume":"126","author":"Holzhauser","year":"2017","journal-title":"Inf. Process. Lett."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Karmarkar N. and Karp R.M., An efficient approximation scheme for the one-dimensional bin-packing problem, in Proceedings of 23rd Annual Symposium on Foundations of Computer Science (FOCS) (1982) 312\u2013320.","DOI":"10.1109\/SFCS.1982.61"},{"key":"R13","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1002\/net.21547","volume":"63","author":"Nurre","year":"2014","journal-title":"Networks"},{"key":"R14","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1016\/j.ejor.2012.07.010","volume":"223","author":"Nurre","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Saito Y. and Shioura A., Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines, in 7th International Symposium on Combinatorial Optimization (ISCO) (2022) 324\u2013335.","DOI":"10.1007\/978-3-031-18530-4_24"},{"key":"R16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.tcs.2012.06.003","volume":"460","author":"Wang","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"R17","first-page":"577","volume":"10","author":"Wang","year":"2014","journal-title":"Pac. J. Optim."},{"key":"R18","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024232\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T08:58:26Z","timestamp":1737449906000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":18,"journal-issue":{"issue":"1"},"alternative-id":["ro230609"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024232","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}