{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458486,0.0001464497,0.000167927,0.00003269434,0.000274199,0.00008498696,0.0001105563,0.0001202031,0.000005873153],"category_scores_gemma":[0.0000530198,0.0001254367,0.00004822619,0.0003688485,0.00001839918,0.00005349328,0.00001159162,0.0002397437,6.864885e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004120714,"about_ca_system_score_gemma":0.00001266879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002875383,"about_ca_topic_score_gemma":0.0000067468,"domain_scores_codex":[0.9991422,0.00004818741,0.0002316835,0.0001693053,0.00008377757,0.0003247889],"domain_scores_gemma":[0.9991829,0.0005269102,0.00004317818,0.0001427351,0.00005111392,0.00005319597],"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.000002945481,0.00000379474,0.00002879362,0.000007253493,0.00002258225,2.970138e-7,0.0001912984,0.5919774,0.00007009343,0.00005109935,0.0002765394,0.4073679],"study_design_scores_gemma":[0.00042888,0.00002771685,0.0007538752,0.0000470939,0.00003295986,0.000009615672,0.00002084241,0.9970306,0.0001297732,0.0002642766,0.00110262,0.0001517745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001440793,0.000904537,0.9951079,0.0001500093,0.0002428746,0.0005283031,0.000001821163,0.0005368604,0.001086878],"genre_scores_gemma":[0.3416457,0.0002286204,0.6568667,0.000200757,0.0006353867,0.00006179798,0.000009994282,0.0000657964,0.0002852826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4072162,"threshold_uncertainty_score":0.5115158,"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."}}