{"id":"https://openalex.org/W2107417081","doi":"https://doi.org/10.1142/s1793830909000130","title":"APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES","display_name":"APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2107417081","doi":"https://doi.org/10.1142/s1793830909000130","mag":"2107417081"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000130","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084121765","display_name":"Tim Nonner","orcid":"https://orcid.org/0000-0001-7638-5689"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"TIM NONNER","raw_affiliation_strings":["Department of Computer Science, Albert Ludwigs University of Freiburg, Georges-K\u00f6hler-Allee 79, 79110 Freiburg im Breisgau, Germany","Supported by DFG research program No 1103 Embedded Microsystems"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert Ludwigs University of Freiburg, Georges-K\u00f6hler-Allee 79, 79110 Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]},{"raw_affiliation_string":"Supported by DFG research program No 1103 Embedded Microsystems","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028307014","display_name":"Alexander Souza","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"ALEXANDER SOUZA","raw_affiliation_strings":["Department of Computer Science, Albert Ludwigs University of Freiburg, Georges-K\u00f6hler-Allee 79, 79110 Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert Ludwigs University of Freiburg, Georges-K\u00f6hler-Allee 79, 79110 Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084121765"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.65210989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"01","issue":"02","first_page":"153","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.992900013923645,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.614201009273529},{"id":"https://openalex.org/keywords/joint","display_name":"Joint (building)","score":0.5681890845298767},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5547220706939697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21764755249023438},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08498373627662659}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.614201009273529},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.5681890845298767},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5547220706939697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21764755249023438},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08498373627662659},{"id":"https://openalex.org/C170154142","wikidata":"https://www.wikidata.org/wiki/Q150737","display_name":"Architectural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1793830909000130","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000130","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.370.672","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.370.672","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nonner.de/homepage/papers/jrp_deadlines.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W124163804","https://openalex.org/W144954708","https://openalex.org/W167338317","https://openalex.org/W1970095041","https://openalex.org/W1991499568","https://openalex.org/W1994612875","https://openalex.org/W2035380861","https://openalex.org/W2037092605","https://openalex.org/W2041673021","https://openalex.org/W2084007448","https://openalex.org/W2092681793","https://openalex.org/W2103772568","https://openalex.org/W2104598661","https://openalex.org/W2119778503","https://openalex.org/W2126050431","https://openalex.org/W2143474538","https://openalex.org/W2143698439","https://openalex.org/W2157164380","https://openalex.org/W4242336842"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"The":[0],"objective":[1],"of":[2],"the":[3,41,45,83],"classical":[4],"Joint":[5],"Replenishment":[6],"Problem":[7],"(JRP)":[8],"is":[9,78,96],"to":[10,33,59,103],"minimize":[11],"ordering":[12],"costs":[13],"by":[14,87],"combining":[15],"orders":[16,30],"in":[17],"two":[18],"stages,":[19],"first":[20],"at":[21,26,40],"some":[22],"retailers,":[23],"and":[24],"then":[25],"a":[27,53,67],"warehouse.":[28],"These":[29],"are":[31],"needed":[32],"satisfy":[34,104],"demands":[35],"that":[36,49,74,89],"appear":[37],"over":[38],"time":[39],"retailers.":[42],"We":[43,71],"investigate":[44],"natural":[46],"special":[47],"case":[48],"each":[50,100],"demand":[51],"has":[52,102],"deadline":[54],"until":[55],"when":[56],"it":[57],"needs":[58],"be":[60],"satisfied.":[61],"For":[62],"this":[63],"case,":[64],"we":[65,81],"present":[66],"randomized":[68],"5/3-approximation":[69],"algorithm.":[70],"moreover":[72],"prove":[73],"JRP":[75,90],"with":[76,91],"deadlines":[77],"APX-hard.":[79],"Finally,":[80],"extend":[82],"known":[84],"hardness":[85],"results":[86],"showing":[88],"linear":[92],"delay":[93],"cost":[94],"functions":[95],"NP-hard,":[97],"even":[98],"if":[99],"retailer":[101],"only":[105],"three":[106],"demands.":[107]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}