{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009350173,0.001264333,0.001061311,0.00073567,0.001166946,0.003406975,0.001256576,0.001575791,0.008671001],"category_scores_gemma":[0.003902011,0.0004559489,0.0009996531,0.002246797,0.001368004,0.003956824,0.001554218,0.002273081,0.002083281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001338027,"about_ca_system_score_gemma":0.00168969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003187202,"about_ca_topic_score_gemma":0.002228302,"domain_scores_codex":[0.9985986,0.0004746428,0.00009316691,0.0002630741,0.0003764267,0.0001939947],"domain_scores_gemma":[0.9990829,0.0005401075,0.0001102247,0.00006775945,0.0001374353,0.00006162593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004002436,0.00007855439,0.0003116656,0.0002839943,0.00004731483,0.0002748535,0.0002134597,0.1244379,0.0005798984,0.7858513,0.02030717,0.06757376],"study_design_scores_gemma":[0.00003209175,0.00004413597,0.0002177497,0.00006427198,0.00002817771,0.0003613229,0.0002193937,0.2301246,0.000391865,0.7072037,0.06128485,0.00002781983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02369482,0.007795152,0.84271,0.003565476,0.0008098664,0.0004563355,0.001067475,0.0004230738,0.1194779],"genre_scores_gemma":[0.492902,0.02102945,0.4049446,0.001106987,0.001756911,0.0008506504,0.002084245,0.0003198045,0.07500532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008671001,"threshold_uncertainty_score":0.02900743,"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."}}