{"id":"W2012762076","doi":"10.1016/s0167-6377(01)00095-5","title":"Minimizing holding and ordering costs subject to a bound on backorders is as easy as solving a single backorder cost model","year":2001,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Subject (documents); Single use; Computer science; Upper and lower bounds; Operations management; Operations research; Mathematics; Economics; Engineering; Process engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005111917,0.0002620984,0.000334711,0.00102377,0.002114618,0.002999365,0.000809531,0.0001200674,0.0004205505],"category_scores_gemma":[0.006074449,0.0002242703,0.00009553571,0.001965531,0.0003747062,0.001158838,0.0004776871,0.0006176067,0.0008815779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004325067,"about_ca_system_score_gemma":0.0003433611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001289906,"about_ca_topic_score_gemma":0.001833573,"domain_scores_codex":[0.9943563,0.0005774528,0.0006020698,0.001167857,0.0023034,0.0009929594],"domain_scores_gemma":[0.9963981,0.001469266,0.00003976375,0.0009230811,0.0006940044,0.0004757998],"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.0003706169,0.0003559995,0.001429875,0.00001522703,0.00005730471,0.00009039324,0.01092103,0.7687758,0.1537457,0.003319819,0.01896014,0.04195808],"study_design_scores_gemma":[0.001157518,0.0004578222,0.0003276616,0.0002297607,0.00001093292,0.00006844327,0.003978131,0.9613107,0.005210037,0.003660097,0.02287962,0.00070925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9202163,0.00008162879,0.02882554,0.04164179,0.00009725038,0.001046147,0.00001343417,0.00004647942,0.008031461],"genre_scores_gemma":[0.9798453,0.00009609448,0.007593124,0.009296205,0.00008425419,0.0001576319,0.000005124754,0.00003864953,0.002883576],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1925349,"threshold_uncertainty_score":0.9998963,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2700245598731367,"score_gpt":0.4598726996339618,"score_spread":0.1898481397608251,"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."}}