{"id":"https://openalex.org/W7225012383","doi":"https://doi.org/10.5281/zenodo.23845964","title":"Integer calendars for fixed-turnover replenishment: a 1/ln 2 guarantee on trees, the price of short cycles and the price of constant gaps","display_name":"Integer calendars for fixed-turnover replenishment: a 1/ln 2 guarantee on trees, the price of short cycles and the price of constant gaps","publication_year":2026,"publication_date":"2026-10-31","ids":{"openalex":"https://openalex.org/W7225012383","doi":"https://doi.org/10.5281/zenodo.23845964"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23845964","doi":"https://doi.org/10.5281/zenodo.23845964","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23845964","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23845964","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Anonymous","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anonymous","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6011000275611877,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6011000275611877,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.3562000095844269,"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/T12288","display_name":"Optimization and Search Problems","score":0.02419999986886978,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"vehicle routing","score":0.7049999833106995},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.5709999799728394},{"id":"https://openalex.org/keywords/rounding","display_name":"rounding","score":0.3160000145435333},{"id":"https://openalex.org/keywords/trees","display_name":"trees","score":0.5509999990463257},{"id":"https://openalex.org/keywords/worst-case-analysis","display_name":"worst-case analysis","score":0.6639999747276306},{"id":"https://openalex.org/keywords/monotone-submodular-functions","display_name":"monotone submodular functions","score":0.593999981880188}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6643000245094299},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6363000273704529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6118000149726868},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5156999826431274},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5152999758720398},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.400299996137619},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3779999911785126},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.366100013256073},{"id":"https://openalex.org/C9991821","wikidata":"https://www.wikidata.org/wiki/Q858520","display_name":"Divisibility rule","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C164680029","wikidata":"https://www.wikidata.org/wiki/Q1055293","display_name":"Multiple","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3492000102996826},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.31290000677108765},{"id":"https://openalex.org/C173734053","wikidata":"https://www.wikidata.org/wiki/Q47577","display_name":"Fibonacci number","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C192065140","wikidata":"https://www.wikidata.org/wiki/Q1147928","display_name":"Multinomial distribution","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C164624739","wikidata":"https://www.wikidata.org/wiki/Q754331","display_name":"Activity-based costing","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23845964","doi":"https://doi.org/10.5281/zenodo.23845964","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23845964","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.23845965","doi":"https://doi.org/10.5281/zenodo.23845965","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23845965","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.23845964","doi":"https://doi.org/10.5281/zenodo.23845964","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23845964","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1622454718","https://openalex.org/W2038259975","https://openalex.org/W2055213643","https://openalex.org/W2082399948","https://openalex.org/W2090925153","https://openalex.org/W2096318933","https://openalex.org/W2100007799","https://openalex.org/W2107417081","https://openalex.org/W2107747430","https://openalex.org/W2109488193","https://openalex.org/W2113638822","https://openalex.org/W2118217956","https://openalex.org/W2123923885","https://openalex.org/W2127654349","https://openalex.org/W2130443144","https://openalex.org/W2131996956","https://openalex.org/W2159921452","https://openalex.org/W2160543991","https://openalex.org/W2161022439","https://openalex.org/W2208994903","https://openalex.org/W2771264424","https://openalex.org/W2796220414","https://openalex.org/W2801670880","https://openalex.org/W2964337044","https://openalex.org/W2990013275","https://openalex.org/W2997039462","https://openalex.org/W3019869956","https://openalex.org/W4308622943","https://openalex.org/W4319792251","https://openalex.org/W4399522664","https://openalex.org/W4417138745","https://openalex.org/W7139935511"],"related_works":["https://openalex.org/W2771264424","https://openalex.org/W7222805519","https://openalex.org/W2996758272","https://openalex.org/W2963249037","https://openalex.org/W7095198093","https://openalex.org/W2106514442","https://openalex.org/W128563282","https://openalex.org/W564124267","https://openalex.org/W2108216402","https://openalex.org/W3099658001"],"abstract_inverted_index":{"Unrefereed":[0],"research":[1],"candidate.":[2],"A":[3],"depot":[4],"must":[5,132],"revisit":[6],"every":[7,130],"client":[8,131],"at":[9,72],"least":[10],"once":[11],"within":[12,97],"that":[13,46,215],"client's":[14],"turnover":[15,100],"time,":[16,87,101],"keeping":[17],"the":[18,50,79,98,109,113,116,149,163,174,182,186,193,196,206,228,262],"long-run":[19],"average":[20],"daily":[21,92],"routing":[22],"cost":[23],"low.":[24],"Bosman":[25,145],"et":[26,146],"al.":[27],"(Algorithmica,":[28],"2022)":[29],"gave":[30],"a":[31,58,68,134,178,200,272,278],"factor-two":[32],"approximation":[33],"on":[34,120,219],"trees":[35],"and":[36,102,156,169,189,210,236,242,261,266,293],"asked":[37],"whether":[38],"it":[39,47],"can":[40],"be":[41,284],"improved.":[42],"This":[43],"package":[44],"shows":[45],"can:":[48],"rounding":[49,259],"event":[51],"times":[52,78],"of":[53,115,144,185],"real-valued":[54],"power-of-two":[55],"clocks":[56],"(with":[57],"logarithmically":[59],"chosen":[60],"common":[61],"phase)":[62],"up":[63],"to":[64],"whole":[65],"days":[66],"gives":[67],"feasible":[69],"calendar":[70,95],"costing":[71],"most":[73],"1/ln":[74,106],"2":[75,107],"\u2248":[76],"1.4427":[77],"optimum,":[80,167],"computed":[81],"deterministically":[82],"in":[83],"O(n":[84],"log":[85],"n)":[86],"for":[88,103,172,227],"any":[89],"monotone":[90],"submodular":[91],"cost.":[93],"The":[94,203,258],"repeats":[96],"longest":[99],"such":[104],"calendars":[105],"is":[108,118,269],"exact":[110,164,212,222,225,243],"worst-case":[111,151,187],"price;":[112],"analysis":[114],"algorithm":[117],"tight":[119],"trees.":[121],"Individual":[122],"gaps":[123,138],"may":[124],"alternate":[125],"between":[126,154],"two":[127],"integers.":[128],"If":[129],"keep":[133],"constant":[135,263],"gap":[136],"with":[137,277],"dividing":[139],"one":[140],"another":[141],"(the":[142],"form":[143],"al.'s":[147],"output),":[148],"best":[150],"factor":[152,201],"lies":[153],"1.6001":[155],"1.6014":[157],"(explicit":[158],"four-ladder":[159],"mixture:":[160],"48/29).":[161],"Also:":[162],"nested":[165],"two-edge":[166],"divisibility":[168],"lcm":[170],"criteria":[171],"attaining":[173],"frequency":[175,197],"lower":[176,180],"bound,":[177,181],"pooled":[179],"cycle-budget":[183],"profile":[184],"family,":[188],"certified":[190],"instances":[191,287],"where":[192],"optimum":[194,223],"exceeds":[195],"bound":[198],"by":[199],"1.204.":[202],"archive":[204],"contains":[205],"manuscript":[207],"(PDF,":[208],"Markdown":[209],"LaTeX),":[211],"standard-library":[213],"verifiers":[214],"do":[216],"not":[217,270,283],"rely":[218],"assert,":[220],"195":[221],"certificates,":[224],"certificates":[226],"constant-gap":[229],"bounds,":[230],"13":[231],"semantic":[232],"negative":[233],"controls,":[234],"CI":[235],"SHA-256":[237],"sums.":[238],"Assurance:":[239],"written":[240],"proofs":[241],"rational":[244],"certificates;":[245],"internal":[246],"AI-assisted":[247],"review":[248],"only":[249],"(not":[250],"peer":[251],"review,":[252],"independent":[253],"reproduction":[254],"or":[255],"formal":[256],"verification).":[257],"tools":[260],"are":[264,288],"classical":[265],"credited.":[267],"Priority":[268],"claimed:":[271],"2025":[273],"DTU":[274],"MSc":[275],"thesis":[276],"closely":[279],"matching":[280],"title":[281],"could":[282],"obtained.":[285],"All":[286],"synthetic.":[289],"Creator:":[290],"Anonymous.":[291],"Text":[292],"data":[294],"CC0-1.0;":[295],"code":[296],"MIT.":[297]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2026-11-01T00:00:00"}