{"id":"W2053944393","doi":"10.1007/s101070050007","title":"A branch-and-cut algorithm for the Undirected Rural Postman Problem","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Binary number; Undirected graph; Combinatorics; Mathematical optimization; Graph; Arithmetic","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001150971,0.001229996,0.001858307,0.001208953,0.001208429,0.001372921,0.00218237,0.002274615,0.0102365],"category_scores_gemma":[0.002494635,0.0008951178,0.0008857057,0.002033645,0.000797225,0.001942057,0.00158347,0.002129437,0.001275323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225373,"about_ca_system_score_gemma":0.002561286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006260364,"about_ca_topic_score_gemma":0.008134841,"domain_scores_codex":[0.9995233,0.000154594,0.00001666641,0.0001096529,0.0001060909,0.00008976447],"domain_scores_gemma":[0.9989311,0.0006951186,0.00008095292,0.00006245929,0.0001329516,0.00009742881],"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.0002027451,0.0003740473,0.0005526784,0.0001747604,0.00006758276,0.0001039498,0.0001019518,0.6915604,0.001497274,0.04527624,0.01215893,0.2479295],"study_design_scores_gemma":[0.0000619132,0.00005438851,0.00009651905,0.00001424044,0.00001666506,0.00003016983,0.00002456163,0.9734308,0.0003328321,0.02357662,0.002353496,0.000007752428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01222443,0.0002059314,0.9803004,0.0003599077,0.00006884655,0.0001637628,0.0001822723,0.0003905076,0.006103921],"genre_scores_gemma":[0.08050849,0.0002357562,0.9106948,0.0001494849,0.00006361561,0.0003164502,0.0004839569,0.0001970157,0.007350426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102365,"threshold_uncertainty_score":0.03424454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295668653358123,"score_gpt":0.2600114274650466,"score_spread":0.2470547409314654,"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."}}