{"id":"W1969119890","doi":"10.1016/j.orl.2014.10.001","title":"Decomposition theorems for linear programs","year":2014,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Linear programming; Bounded function; Decomposition; Residual; Class (philosophy); Applied mathematics; Combinatorics; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.001644275,0.00008033437,0.00008488332,0.0001557458,0.000329954,0.0001675522,0.0001565894,0.00004795761,0.00002583593],"category_scores_gemma":[0.0002427733,0.0000794955,0.00003861171,0.0003108595,0.00007153864,0.0001536577,0.00002025225,0.0001930322,0.00005216821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007106422,"about_ca_system_score_gemma":0.00001262502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001016861,"about_ca_topic_score_gemma":0.00001369936,"domain_scores_codex":[0.9989036,0.0002407847,0.0001572113,0.0001555446,0.0002207811,0.0003220785],"domain_scores_gemma":[0.9993013,0.0002105192,0.00000436454,0.0002313328,0.0001785656,0.00007398139],"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.000003722784,0.00001590207,0.00004681812,0.00002271553,0.00001189149,2.081475e-7,0.0001503329,0.9198787,0.05726882,0.004355102,0.001448598,0.01679718],"study_design_scores_gemma":[0.0002243348,0.00004412685,0.00004660976,0.00001548536,0.000002746924,0.000001521643,0.00002105374,0.9821484,0.007610175,0.00008143204,0.00970979,0.00009431293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1110087,0.00001033433,0.8849468,0.002184267,0.0001166384,0.0005454686,0.00000392196,0.0002346138,0.0009492801],"genre_scores_gemma":[0.5528152,0.000007511404,0.4459912,0.0002153932,0.0003134738,0.0003879057,0.000113291,0.00004695169,0.0001091249],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4418064,"threshold_uncertainty_score":0.3241733,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05506757424898105,"score_gpt":0.390566865604166,"score_spread":0.335499291355185,"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."}}