{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003610831,0.0001978996,0.0001898968,0.00003557747,0.0001901908,0.0001481002,0.000211847,0.00015341,0.00007152959],"category_scores_gemma":[0.00002010751,0.0001405896,0.00007005948,0.0002259051,0.00004916308,0.0001857155,0.00005502406,0.0002647451,0.00002176177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000323355,"about_ca_system_score_gemma":0.000009176756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003663755,"about_ca_topic_score_gemma":0.000005530109,"domain_scores_codex":[0.9989243,0.00004940324,0.0002601755,0.0001780301,0.0001256006,0.0004625583],"domain_scores_gemma":[0.9990907,0.0003970152,0.00004839319,0.0002747771,0.00008453721,0.000104571],"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.000002569761,0.00000852186,0.0001966009,0.00001886688,0.00004805537,3.063188e-7,0.0001866058,0.3973495,0.000158875,0.00006122611,0.006914717,0.5950541],"study_design_scores_gemma":[0.0004743395,0.00003125435,0.001652294,0.0000273259,0.00002782953,0.000009706383,0.00004101026,0.9907218,0.0001115998,0.0003385861,0.006359023,0.0002052062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00733425,0.001192079,0.9880103,0.0005978197,0.0004345555,0.001023272,0.00000576651,0.0004367895,0.0009651773],"genre_scores_gemma":[0.4017302,0.000391649,0.5930085,0.001060743,0.001537565,0.0006675186,0.00003452615,0.0002158269,0.001353526],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.594849,"threshold_uncertainty_score":0.5733079,"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."}}