{"id":"W4250280589","doi":"10.1002/net.20307","title":"A branch‐and‐cut algorithm for the undirected prize collecting traveling salesman problem","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Orienteering; Vertex (graph theory); Bottleneck traveling salesman problem; Computer science; Branch and cut; Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; 2-opt; Mathematics; Algorithm; Traveling purchaser problem; Mathematical optimization; Linear programming; Artificial intelligence","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.001119324,0.0009416555,0.001049737,0.0009679649,0.0008110815,0.001065903,0.001385776,0.001091395,0.005438739],"category_scores_gemma":[0.002526001,0.0005060973,0.0007057495,0.001690015,0.0005670173,0.001252602,0.001131658,0.00155877,0.0005296016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049331,"about_ca_system_score_gemma":0.001707962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004759562,"about_ca_topic_score_gemma":0.003523512,"domain_scores_codex":[0.9994369,0.0001811352,0.00003136693,0.0001125533,0.0001263303,0.0001117471],"domain_scores_gemma":[0.9990527,0.0005875482,0.00008029121,0.00005534261,0.0001427436,0.00008133246],"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.0002970195,0.000316471,0.0007018002,0.0002208013,0.00007595202,0.000150463,0.0001693632,0.6436868,0.00218684,0.04562884,0.009459858,0.2971058],"study_design_scores_gemma":[0.00009060756,0.00007557243,0.000136599,0.00001565643,0.00002034658,0.00004504553,0.00003424162,0.9669284,0.0009973655,0.02897107,0.002673961,0.00001102872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02427378,0.0001756316,0.9692197,0.0002623575,0.00005162953,0.0002092959,0.0001723049,0.0003971223,0.005238245],"genre_scores_gemma":[0.1558416,0.0001925061,0.8395499,0.0001032755,0.00003929749,0.0004068004,0.0005861981,0.0001532289,0.003127224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005438739,"threshold_uncertainty_score":0.01819444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01551276103215186,"score_gpt":0.2532832045046128,"score_spread":0.2377704434724609,"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."}}