{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760345,0.002697074,0.001437098,0.002546456,0.0009114936,0.002847444,0.001484191,0.001126908,0.01269222],"category_scores_gemma":[0.007072828,0.001169748,0.002844005,0.002817099,0.002055175,0.005354489,0.002571296,0.007424781,0.002326302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902608,"about_ca_system_score_gemma":0.001421831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001860227,"about_ca_topic_score_gemma":0.001504467,"domain_scores_codex":[0.9988686,0.0004422198,0.00004491771,0.0001881114,0.0003088505,0.0001473177],"domain_scores_gemma":[0.9968852,0.002112436,0.0001601939,0.0002351402,0.0004489058,0.0001581339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003068768,0.0000546887,0.0001343974,0.0001459243,0.00004536374,0.00004443477,0.0001244919,0.01328618,0.0006594613,0.9471747,0.01086628,0.02743334],"study_design_scores_gemma":[0.00001569355,0.00001585929,0.0001072346,0.0000435214,0.00002116879,0.00003744691,0.00002801639,0.04934446,0.000287827,0.9435565,0.00653344,0.000008786122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007108387,0.002952799,0.9325349,0.001828238,0.0003357929,0.00006606516,0.0003892683,0.0002193402,0.05456517],"genre_scores_gemma":[0.3872509,0.01480195,0.4829281,0.002738054,0.002436882,0.001549241,0.002566092,0.001365496,0.1043632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01269222,"threshold_uncertainty_score":0.04245967,"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."}}