{"id":"W1991149726","doi":"10.1287/trsc.1030.0079","title":"Traveling Salesman Problems with Profits","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":617,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Profit (economics); Generalization; Vertex (graph theory); Heuristic; Traveling purchaser problem; Operations research; Computer science; Combinatorial optimization; Bottleneck traveling salesman problem; Mathematics; Economics; Combinatorics; Microeconomics; Graph","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.0004343075,0.00008831146,0.0000764706,0.00008554287,0.0001093423,0.0000419231,0.000159369,0.00002419204,0.00002867898],"category_scores_gemma":[0.000008334488,0.00007925955,0.00001280054,0.0008153219,0.0001142337,0.0005080436,8.120352e-7,0.00008166708,0.00001936369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004077157,"about_ca_system_score_gemma":0.00004842343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002381956,"about_ca_topic_score_gemma":0.00003660411,"domain_scores_codex":[0.9990821,0.000006995478,0.0001864771,0.0001838833,0.0003233145,0.0002171613],"domain_scores_gemma":[0.9996554,0.00001676168,0.00002804415,0.0001239733,0.00009792182,0.00007786317],"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.00000160085,0.000005534977,0.00293701,0.0000180303,0.000001933304,5.562813e-7,0.00160397,0.9713183,0.01527006,0.0005484516,0.00000401386,0.008290523],"study_design_scores_gemma":[0.0005188194,0.00003640343,0.1061895,0.0000694744,0.00001587132,0.000005470345,0.0001297188,0.831332,0.05999776,0.00004390246,0.001319898,0.0003412364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5230128,0.00002080558,0.473717,0.00007783555,0.00004963461,0.0001550378,0.000002611222,0.0003777014,0.002586611],"genre_scores_gemma":[0.8000012,0.000006286718,0.199855,0.00002575025,0.00002472202,0.00001181787,0.000004395094,0.00001422508,0.0000566223],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2769884,"threshold_uncertainty_score":0.3232111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01684428022553878,"score_gpt":0.2527487551312724,"score_spread":0.2359044749057337,"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."}}