{"id":"W2208994903","doi":"10.1007/s10107-015-0920-3","title":"The submodular joint replenishment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Defense Science and Engineering Graduate; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Massachusetts Institute of Technology; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Submodular set function; Holding cost; Mathematical optimization; Cardinality (data modeling); Heuristic; Mathematics; Dynamic programming; Approximation algorithm; Average cost; Job shop scheduling; Total cost; Computer science; Schedule","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003455121,0.001600723,0.002658181,0.0009760821,0.0008007605,0.003832706,0.002414457,0.002512839,0.007903806],"category_scores_gemma":[0.009718196,0.001414413,0.001267534,0.002460662,0.001792222,0.004466936,0.001902634,0.003187601,0.0007335547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001984357,"about_ca_system_score_gemma":0.003202498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003121597,"about_ca_topic_score_gemma":0.002764818,"domain_scores_codex":[0.9981502,0.001029439,0.00006640006,0.0003094574,0.0002610878,0.0001834542],"domain_scores_gemma":[0.9954022,0.003466768,0.0002960483,0.0002274698,0.0002626026,0.0003449189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003243795,0.000332027,0.0008069522,0.0006608645,0.0001845982,0.0003657871,0.0002161289,0.4960424,0.0009202295,0.4095034,0.01797966,0.07266358],"study_design_scores_gemma":[0.00008921249,0.0001015494,0.0001982347,0.00006474453,0.00004187243,0.0001777383,0.00008124719,0.6034706,0.0003539027,0.3900349,0.005353694,0.00003227952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04752744,0.002421816,0.9155716,0.003447813,0.0002560804,0.0001529974,0.001142149,0.0002570692,0.02922296],"genre_scores_gemma":[0.6418968,0.003872988,0.3111573,0.001010183,0.0006146475,0.0005513202,0.001541693,0.0003047532,0.0390504],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007903806,"threshold_uncertainty_score":0.02644092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06011719388139675,"score_gpt":0.2406231647610436,"score_spread":0.1805059708796469,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}