{"id":"W2585983673","doi":"","title":"A Branch-Price-and-Cut Algorithm for the Min-Max k-Vehicle Windy Rural Postman Problem","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Branch and cut; Set (abstract data type); Algorithm; Vehicle routing problem; Mathematical optimization; Graph; Mathematics; Computer science; 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.001154604,0.001538977,0.001794545,0.001057175,0.001169257,0.00131941,0.001939456,0.001928537,0.01204408],"category_scores_gemma":[0.002399809,0.0007904752,0.0009084979,0.001968327,0.0006839184,0.002192393,0.001396493,0.001941865,0.001544707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00122519,"about_ca_system_score_gemma":0.002392324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004493637,"about_ca_topic_score_gemma":0.006716252,"domain_scores_codex":[0.99951,0.0001551285,0.00002390091,0.0001153952,0.0000864588,0.000108983],"domain_scores_gemma":[0.9989949,0.000649369,0.0001084512,0.00005842364,0.00008965518,0.00009911949],"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.0003877055,0.0004686937,0.001018896,0.0003677976,0.00009564196,0.0002501653,0.000168842,0.7304446,0.001780066,0.03105221,0.01689074,0.2170747],"study_design_scores_gemma":[0.0001259533,0.0001517317,0.0002276122,0.00002508224,0.00002965328,0.0001104099,0.00007836748,0.9637601,0.0007943736,0.03045884,0.004220865,0.00001692122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03486217,0.0006476867,0.9511181,0.0006425421,0.0001015878,0.0005136903,0.0005731365,0.0006836636,0.01085731],"genre_scores_gemma":[0.1439591,0.0004475361,0.846327,0.0001733806,0.00007136512,0.0006068347,0.001156963,0.0002793048,0.006978466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204408,"threshold_uncertainty_score":0.04029143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01122336435008977,"score_gpt":0.2084854226834577,"score_spread":0.1972620583333679,"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."}}