{"id":"https://openalex.org/W2771264424","doi":"https://doi.org/10.1007/s00453-022-00974-4","title":"Approximation Algorithms for Replenishment Problems with Fixed Turnover Times","display_name":"Approximation Algorithms for Replenishment Problems with Fixed Turnover Times","publication_year":2022,"publication_date":"2022-05-16","ids":{"openalex":"https://openalex.org/W2771264424","doi":"https://doi.org/10.1007/s00453-022-00974-4","mag":"2771264424"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-00974-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00974-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00974-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00974-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026347724","display_name":"Thomas Bosman","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Thomas Bosman","raw_affiliation_strings":["Amsterdam, The Netherlands","UvA - University of Amsterdam [Amsterdam] = Universiteit van Amsterdam (Spui 21 1012 WX Amsterdam - Netherlands)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Amsterdam, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"UvA - University of Amsterdam [Amsterdam] = Universiteit van Amsterdam (Spui 21 1012 WX Amsterdam - Netherlands)","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044760370","display_name":"Martijn van Ee","orcid":"https://orcid.org/0000-0002-7724-8990"},"institutions":[{"id":"https://openalex.org/I4210119716","display_name":"Netherlands Defence Academy","ror":"https://ror.org/02dnvjf04","country_code":"NL","type":"facility","lineage":["https://openalex.org/I4210094335","https://openalex.org/I4210119716","https://openalex.org/I4210140876"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Martijn van Ee","raw_affiliation_strings":["Netherlands Defence Academy, Den Helder, The Netherlands","Netherlands Defence Academy (France)"],"raw_orcid":"https://orcid.org/0000-0002-7724-8990","affiliations":[{"raw_affiliation_string":"Netherlands Defence Academy, Den Helder, The Netherlands","institution_ids":["https://openalex.org/I4210119716"]},{"raw_affiliation_string":"Netherlands Defence Academy (France)","institution_ids":["https://openalex.org/I4210119716"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101881128","display_name":"Yang Jiao","orcid":"https://orcid.org/0000-0001-9583-0784"},"institutions":[{"id":"https://openalex.org/I4210092639","display_name":"Boeing (Spain)","ror":"https://ror.org/00fxnmt68","country_code":"ES","type":"company","lineage":["https://openalex.org/I1295339012","https://openalex.org/I4210092639"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Yang Jiao","raw_affiliation_strings":["Boeing Research & Technology, Tukwila, WA, USA","Boeing Research  and Technology Europe (Av. Sur del Aeropuerto de Barajas, 38, 28042 Madrid,  - Spain)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boeing Research & Technology, Tukwila, WA, USA","institution_ids":["https://openalex.org/I4210092639"]},{"raw_affiliation_string":"Boeing Research  and Technology Europe (Av. Sur del Aeropuerto de Barajas, 38, 28042 Madrid,  - Spain)","institution_ids":["https://openalex.org/I4210092639"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064823807","display_name":"Alberto Marchetti-Spaccamela","orcid":"https://orcid.org/0000-0002-7991-4416"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["FR","IT"],"is_corresponding":false,"raw_author_name":"Alberto Marchetti-Spaccamela","raw_affiliation_strings":["Erable, INRIA, Lyon, France","Sapienza University of Rome, Rome, Italy","UNIROMA - Universit\u00e0 degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (Piazzale Aldo Moro 5, 00185 Roma - Italy)","ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), Campus DOUA 43, Boulevard du 11 Novembre 1918 69622 Villeurbanne cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erable, INRIA, Lyon, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"UNIROMA - Universit\u00e0 degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (Piazzale Aldo Moro 5, 00185 Roma - Italy)","institution_ids":["https://openalex.org/I861853513"]},{"raw_affiliation_string":"ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), Campus DOUA 43, Boulevard du 11 Novembre 1918 69622 Villeurbanne cedex - France)","institution_ids":["https://openalex.org/I100532134"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087844619","display_name":"R. Ravi","orcid":"https://orcid.org/0000-0001-7603-1207"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ravi","raw_affiliation_strings":["Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","Tepper School of Business (5000 Forbes Ave., Pittsburgh, PA 15213, USA - United States)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Tepper School of Business (5000 Forbes Ave., Pittsburgh, PA 15213, USA - United States)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044184077","display_name":"Leen Stougie","orcid":"https://orcid.org/0000-0001-6938-8902"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["FR","NL"],"is_corresponding":false,"raw_author_name":"Leen Stougie","raw_affiliation_strings":["Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands","Erable, INRIA, Lyon, France","Vrije Universiteit, Amsterdam, The Netherlands","CWI - Centrum Wiskunde & Informatica (Science Park 123, 1098 XG Amsterdam - Netherlands)","ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), Campus DOUA 43, Boulevard du 11 Novembre 1918 69622 Villeurbanne cedex - France)","VU - Vrije Universiteit Amsterdam [Amsterdam] (De Boelelaan 1105 1081 HV Amsterdam - Netherlands)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum voor Wiskunde en Informatica (CWI), Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Erable, INRIA, Lyon, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Vrije Universiteit, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]},{"raw_affiliation_string":"CWI - Centrum Wiskunde & Informatica (Science Park 123, 1098 XG Amsterdam - Netherlands)","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"ERABLE - Equipe de recherche europ\u00e9enne en algorithmique et biologie formelle et exp\u00e9rimentale (Universit\u00e9 Claude Bernard (Lyon 1), Campus DOUA 43, Boulevard du 11 Novembre 1918 69622 Villeurbanne cedex - France)","institution_ids":["https://openalex.org/I100532134"]},{"raw_affiliation_string":"VU - Vrije Universiteit Amsterdam [Amsterdam] (De Boelelaan 1105 1081 HV Amsterdam - Netherlands)","institution_ids":["https://openalex.org/I865915315"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":9,"corresponding_author_ids":["https://openalex.org/A5044760370"],"corresponding_institution_ids":["https://openalex.org/I4210119716"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.1126,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.43671436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"84","issue":"9","first_page":"2597","last_page":"2621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9983999729156494,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"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/T12546","display_name":"Smart Parking Systems Research","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/computer-science","display_name":"Computer science","score":0.737202525138855},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5889334678649902},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5487270951271057},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.5418491959571838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.54051673412323},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5224674940109253},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.5146713852882385},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4954763650894165},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4818800091743469},{"id":"https://openalex.org/keywords/fixed-cost","display_name":"Fixed cost","score":0.4310838282108307},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.352131724357605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18409645557403564},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07475915551185608}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.737202525138855},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5889334678649902},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5487270951271057},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.5418491959571838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.54051673412323},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5224674940109253},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.5146713852882385},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4954763650894165},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4818800091743469},{"id":"https://openalex.org/C42866809","wikidata":"https://www.wikidata.org/wiki/Q466764","display_name":"Fixed cost","level":2,"score":0.4310838282108307},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.352131724357605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18409645557403564},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07475915551185608},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s00453-022-00974-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00974-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00974-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire/23700de2-34d4-4d92-b708-e2973fc77215","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/23700de2-34d4-4d92-b708-e2973fc77215","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2022, 'Approximation Algorithms for Replenishment Problems with Fixed Turnover Times', Algorithmica, vol. 84, no. 9, pp. 2597-2621. https://doi.org/10.1007/s00453-022-00974-4","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:arXiv.org:1712.05218","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1712.05218","pdf_url":"https://arxiv.org/pdf/1712.05218","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:cwi:oai:cwi.nl:32720","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/32720","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 84, 2597 - 2621","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-03832879v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03832879","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2022, 84 (9), pp.2597-2621. ⟨10.1007/s00453-022-00974-4⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1680255","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1680255","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research.vu.nl:publications/23700de2-34d4-4d92-b708-e2973fc77215","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/citedby.url?scp=85130177052&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bosman, T, van Ee, M, Jiao, Y, Marchetti-Spaccamela, A, Ravi, R & Stougie, L 2022, 'Approximation Algorithms for Replenishment Problems with Fixed Turnover Times', Algorithmica, vol. 84, no. 9, pp. 2597-2621. https://doi.org/10.1007/s00453-022-00974-4","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1712.05218","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1712.05218","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-00974-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-00974-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-00974-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G3957328","display_name":null,"funder_award_id":"CCF-1655442","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6955058338","display_name":null,"funder_award_id":"CCF-1527032","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7558598159","display_name":null,"funder_award_id":"N00014-18-1-2099","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G881133349","display_name":"Preliminary Algorithmic Foundations for Ranking Quizzes and Students from Student-sourced Quizzes","funder_award_id":"1655442","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8922701126","display_name":"AF: SMALL: Approximation Algorithms Matching Integrality Gaps for Network Design","funder_award_id":"1527032","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2771264424.pdf","grobid_xml":"https://content.openalex.org/works/W2771264424.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1501066815","https://openalex.org/W1546988069","https://openalex.org/W1576101174","https://openalex.org/W1797146219","https://openalex.org/W1798684815","https://openalex.org/W1963899113","https://openalex.org/W1980002155","https://openalex.org/W2009415693","https://openalex.org/W2011039300","https://openalex.org/W2021372200","https://openalex.org/W2043148658","https://openalex.org/W2082353536","https://openalex.org/W2082399948","https://openalex.org/W2089225049","https://openalex.org/W2092928619","https://openalex.org/W2095381673","https://openalex.org/W2118217956","https://openalex.org/W2127654349","https://openalex.org/W2138358085","https://openalex.org/W2161022439","https://openalex.org/W2199987713","https://openalex.org/W2568208948","https://openalex.org/W2762808683","https://openalex.org/W2964337044","https://openalex.org/W2979470511","https://openalex.org/W3030774092","https://openalex.org/W3032187348","https://openalex.org/W3091584266","https://openalex.org/W3098817740","https://openalex.org/W3181683098","https://openalex.org/W4243780282","https://openalex.org/W4294129689","https://openalex.org/W6600065759"],"related_works":["https://openalex.org/W2000785801","https://openalex.org/W986318368","https://openalex.org/W2384410913","https://openalex.org/W2352878646","https://openalex.org/W2004734601","https://openalex.org/W2130149817","https://openalex.org/W2990194547","https://openalex.org/W1480123525","https://openalex.org/W2110099436","https://openalex.org/W3124269948"],"abstract_inverted_index":{"Abstract":[0],"We":[1,213],"introduce":[2],"and":[3,160,195,207,228,256,289],"study":[4,214],"a":[5,18,35,50,82,86,141,147,185,196,246,257,268,278,285,290],"class":[6],"of":[7,110,125,132,140,150,192,270],"optimization":[8],"problems":[9,13,299],"we":[10,79,120,244,266,276],"call":[11],"replenishment":[12,83,94],"with":[14,31],"fixed":[15,148],"turnover":[16,54,197],"times:":[17],"very":[19],"natural":[20,70],"model":[21,164],"that":[22,72,78,170],"has":[23,173],"received":[24],"little":[25],"attention":[26],"in":[27,135],"the":[28,46,53,92,108,115,123,130,137,153,190,215,224,233,251,260,295],"literature.":[29],"Clients":[30,64],"capacity":[32],"for":[33,165,217,250,259,264,287,294],"storing":[34],"certain":[36,51],"commodity":[37,47],"are":[38],"located":[39],"at":[40,43],"various":[41],"places;":[42],"each":[44,193],"client":[45,87,194],"depletes":[48],"within":[49,146],"time,":[52,55],"which":[56,136,265],"is":[57,77,156],"constant":[58],"but":[59,90],"can":[60,180],"vary":[61],"between":[62],"locations.":[63],"should":[65],"never":[66],"run":[67],"empty.":[68],"The":[69],"feature":[71],"makes":[73,200],"this":[74,118],"problem":[75,172,216,252,261],"interesting":[76],"may":[80],"schedule":[81],"(well)":[84],"before":[85],"becomes":[88],"empty,":[89],"then":[91],"next":[93,138],"will":[95],"be":[96,105,144,181],"due":[97],"earlier":[98],"also.":[99],"This":[100,199],"added":[101],"workload":[102],"needs":[103],"to":[104,113],"balanced":[106],"against":[107],"cost":[109,227,236],"routing":[111,127],"vehicles":[112],"do":[114],"replenishments.":[116],"In":[117],"paper,":[119],"focus":[121],"on":[122,253,262,282],"aspect":[124],"minimizing":[126],"costs.":[128],"However,":[129,178],"framework":[131],"recurring":[133],"tasks,":[134],"job":[139],"task":[142],"must":[143],"done":[145],"amount":[149],"time":[151,176,292],"after":[152],"previous":[154],"one":[155],"much":[157],"more":[158],"general":[159,254,283],"gives":[161],"an":[162,174],"adequate":[163],"many":[166],"practical":[167],"situations.":[168],"Note":[169],"our":[171],"infinite":[175],"horizon.":[177],"it":[179,209],"fully":[182],"characterized":[183],"by":[184],"compact":[186],"input,":[187],"containing":[188],"only":[189],"location":[191],"time.":[198],"determining":[201],"its":[202],"computational":[203],"complexity":[204],"highly":[205],"challenging":[206],"indeed":[208],"remains":[210],"essentially":[211],"unresolved.":[212],"two":[218],"objectives:":[219],"min":[220,229,241,273],"\u2013":[221,230,242,274],"avg":[222,275],"minimizes":[223,232],"average":[225],"tour":[226,235],"max":[231,243],"maximum":[234],"over":[237],"all":[238],"days.":[239],"For":[240,272],"derive":[245],"logarithmic":[247,279],"factor":[248,280],"approximation":[249,281],"metrics":[255],"6-approximation":[258],"trees,":[263,288],"have":[267],"proof":[269],"NP-hardness.":[271],"present":[277],"metrics,":[284],"2-approximation":[286],"pseudopolynomial":[291],"algorithm":[293],"line.":[296],"Many":[297],"intriguing":[298],"remain":[300],"open.":[301]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2022-10-02T00:00:00"}