{"id":"W2163513576","doi":"10.1002/net.21520","title":"A branch‐price‐and‐cut algorithm for the min‐max <i>k</i>‐vehicle windy rural postman problem","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Set (abstract data type); Branch and cut; Computer science; Mathematical optimization; Algorithm; Graph; Vehicle routing problem; Mathematics; Combinatorics; Integer programming; Routing (electronic design automation)","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.001004255,0.001156794,0.001383421,0.000902915,0.0008054418,0.001083143,0.001537277,0.00152454,0.009351803],"category_scores_gemma":[0.002170646,0.0006641403,0.000707646,0.001461039,0.0005574723,0.001352848,0.001114717,0.001585592,0.0008811308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001062117,"about_ca_system_score_gemma":0.001903062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005722444,"about_ca_topic_score_gemma":0.005841478,"domain_scores_codex":[0.9996002,0.000142132,0.00001765996,0.00008294534,0.0000694564,0.000087639],"domain_scores_gemma":[0.9988921,0.0007821003,0.00009103076,0.000045076,0.00009921739,0.00009049573],"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.000254314,0.0002902095,0.000733569,0.0002204164,0.00005860986,0.0001611526,0.0001133097,0.8188789,0.001313126,0.02069612,0.009441944,0.1478383],"study_design_scores_gemma":[0.00006142507,0.00006203496,0.0001059614,0.00001251484,0.00001017536,0.00003818821,0.00002943856,0.9858207,0.0003795121,0.01200371,0.001469378,0.000006943555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03805892,0.0005490448,0.9496461,0.0004958537,0.0000812015,0.0003547811,0.0003549679,0.0004619648,0.009996989],"genre_scores_gemma":[0.1876343,0.0003485876,0.8046831,0.0001386662,0.00005964927,0.0004788477,0.0006971882,0.0001833284,0.005776281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009351803,"threshold_uncertainty_score":0.03128487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007274112739817685,"score_gpt":0.2195417183200414,"score_spread":0.2122676055802238,"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."}}