{"id":"W4320039432","doi":"10.1007/s10107-023-01930-y","title":"A novel reformulation for the single-sink fixed-charge transportation problem","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval; Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Transportation theory; Fixed charge; Leverage (statistics); Mathematical optimization; Knapsack problem; Mathematics; Linear programming; Integer programming; Heuristic; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0005209277,0.0002091062,0.0002291455,0.00009384452,0.0002176595,0.0001611086,0.0001695127,0.0001133767,0.00005909645],"category_scores_gemma":[0.0001665116,0.0001487484,0.0001480291,0.000557129,0.00005511343,0.0002018054,0.00001288776,0.0001434552,0.0001569701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005134768,"about_ca_system_score_gemma":0.000007411857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001145723,"about_ca_topic_score_gemma":0.000004195977,"domain_scores_codex":[0.9985188,0.000008017371,0.0005239192,0.0001979036,0.0002706733,0.0004806734],"domain_scores_gemma":[0.9990487,0.0004846642,0.00006289323,0.0002306002,0.00007728666,0.00009588007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003269347,0.0005022732,0.00001310572,0.00440874,0.0002291851,0.000004128788,0.005004775,0.04492639,0.009014077,0.2641077,0.001649166,0.6701078],"study_design_scores_gemma":[0.0005958875,0.00007102522,0.00002236489,0.0001546465,0.00009665472,0.000005707489,0.0003551334,0.94964,0.001011091,0.01887086,0.02885129,0.0003253747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001490906,0.00004463468,0.9928789,0.0004913536,0.0001281957,0.001734731,0.0000117148,0.0019237,0.001295923],"genre_scores_gemma":[0.4716815,0.00001478221,0.5250741,0.00007482775,0.0002064727,0.001704894,0.0002458432,0.0001899919,0.0008075744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9047136,"threshold_uncertainty_score":0.6065782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03791356835714092,"score_gpt":0.2567633901263109,"score_spread":0.21884982176917,"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."}}