{"id":"W2759685288","doi":"10.1287/trsc.2017.0783","title":"A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Integer programming; Traverse; Mathematical optimization; Linear programming; Extension (predicate logic); Branch and cut; Mathematics; Column generation; Heuristic; Binary number; Minimum weight; Algorithm; Set (abstract data type); Computer science; Combinatorics","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.0006549378,0.00008038762,0.00007765194,0.00004200312,0.0007693873,0.000187179,0.0003420725,0.00002548959,0.000006093089],"category_scores_gemma":[0.00005054866,0.00006254516,0.00002731369,0.0001115826,0.0002773202,0.0004913585,0.000004042444,0.0000632455,0.000002458505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001401327,"about_ca_system_score_gemma":0.00002664728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004084993,"about_ca_topic_score_gemma":0.00005118487,"domain_scores_codex":[0.99931,0.000005929517,0.0001610103,0.0001407565,0.0001916132,0.00019073],"domain_scores_gemma":[0.9994447,0.00008904167,0.00005727463,0.000251455,0.0001014667,0.00005603362],"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.000007957753,0.00001333265,0.009865317,0.00006642644,0.00001971923,0.000001237874,0.004595561,0.1637888,0.02042035,0.002461195,0.00004364119,0.7987164],"study_design_scores_gemma":[0.0003204215,0.00001136221,0.2309843,0.00001473032,0.00001387514,0.000001640598,0.00008378242,0.7624679,0.00554046,0.0002385834,0.0002182644,0.0001046607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1297144,0.00004407914,0.8690175,0.0003041567,0.0002025652,0.0003395044,0.00001978745,0.0001291607,0.0002288365],"genre_scores_gemma":[0.7676462,0.00002288926,0.2321638,0.00002949228,0.00002733197,0.00003589882,0.000003160641,0.00001116609,0.00006002176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7986118,"threshold_uncertainty_score":0.5917583,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02146653535264469,"score_gpt":0.3028421713022516,"score_spread":0.2813756359496069,"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."}}