{"id":"https://openalex.org/W4405934357","doi":"https://doi.org/10.1051/ro/2024232","title":"Approximation algorithms for the integrated path and bin packing problem","display_name":"Approximation algorithms for the integrated path and bin packing problem","publication_year":2024,"publication_date":"2024-12-31","ids":{"openalex":"https://openalex.org/W4405934357","doi":"https://doi.org/10.1051/ro/2024232"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2024232","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2024232","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro230609.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro230609.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054712771","display_name":"Weidong Li","orcid":"https://orcid.org/0000-0003-3094-4347"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weidong Li","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3094-4347","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068385041","display_name":"Ruiqing Sun","orcid":"https://orcid.org/0000-0002-0306-8268"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ruiqing Sun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8443,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78202437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"59","issue":"1","first_page":"325","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.930400013923645,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.8971384763717651},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7447397112846375},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7179502248764038},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6753107905387878},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5141704082489014},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5139791369438171},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4585551619529724},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.44594916701316833},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44197922945022583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4407047927379608},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.43088972568511963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42121070623397827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37380796670913696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.348858505487442},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.220492422580719}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8971384763717651},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7447397112846375},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7179502248764038},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6753107905387878},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5141704082489014},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5139791369438171},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4585551619529724},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.44594916701316833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44197922945022583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4407047927379608},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.43088972568511963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42121070623397827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37380796670913696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.348858505487442},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.220492422580719},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ro/2024232","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2024232","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro230609.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1051/ro/2024232","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2024232","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro230609.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G905374995","display_name":null,"funder_award_id":"12071417","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4405934357.pdf","grobid_xml":"https://content.openalex.org/works/W4405934357.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W179790402","https://openalex.org/W1969076261","https://openalex.org/W1977276352","https://openalex.org/W1980307941","https://openalex.org/W2037958162","https://openalex.org/W2065000990","https://openalex.org/W2066047491","https://openalex.org/W2093979815","https://openalex.org/W2104399828","https://openalex.org/W2112504072","https://openalex.org/W2123068254","https://openalex.org/W2130626677","https://openalex.org/W2145028977","https://openalex.org/W2571358802","https://openalex.org/W2924612178","https://openalex.org/W2963769406","https://openalex.org/W4312883194"],"related_works":["https://openalex.org/W2078833192","https://openalex.org/W2042249499","https://openalex.org/W2398075730","https://openalex.org/W2173431370","https://openalex.org/W2117588054","https://openalex.org/W2143410025","https://openalex.org/W2087826159","https://openalex.org/W1442399089","https://openalex.org/W2962917430","https://openalex.org/W3214829809"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"consider":[4],"the":[5,15,23,26],"integrated":[6],"path":[7,27],"and":[8,42],"bin":[9],"packing":[10,22],"problem,":[11],"which":[12],"to":[13,21],"use":[14],"minimum":[16],"number":[17],"of":[18],"unit-size":[19],"bins":[20],"arcs":[24],"on":[25],"between":[28],"two":[29],"specific":[30],"vertices":[31],"in":[32],"a":[33,39],"given":[34],"directed":[35],"graph.":[36],"We":[37],"propose":[38],"3/2-approximation":[40],"algorithm":[41],"an":[43],"asymptotic":[44],"polynomial":[45],"time":[46],"approximation":[47],"scheme.":[48]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}