{"id":"W2944565881","doi":"10.1016/j.ejor.2019.04.047","title":"The Steiner Traveling Salesman Problem and its extensions","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Mathematics; Steiner tree problem; Mathematical optimization; Integer programming; Extension (predicate logic); Graph; Branch and cut; 2-opt; Combinatorics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.006988458,0.0000679394,0.00008985589,0.00009458743,0.0002695834,0.0001897108,0.0002116276,0.00001465117,0.00006211287],"category_scores_gemma":[0.0004580945,0.00004577149,0.00002880446,0.0001882079,0.00003702634,0.0001764209,0.00005670787,0.0005231433,0.00009867312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003201096,"about_ca_system_score_gemma":0.0000653492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.880825e-7,"about_ca_topic_score_gemma":3.458636e-7,"domain_scores_codex":[0.9980464,0.0008015485,0.0003392532,0.00008236321,0.0005342264,0.0001961851],"domain_scores_gemma":[0.9984998,0.0005215314,0.00003555112,0.0001019867,0.0007405123,0.0001006045],"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.00004919008,0.00002532467,0.0008046632,0.00004870473,0.00008790183,0.00007032263,0.0009902811,0.8780761,0.08565686,0.01430306,0.003588493,0.01629909],"study_design_scores_gemma":[0.001770264,0.0004951504,0.02972692,0.0003511193,0.00001498133,0.0005463593,0.0006952279,0.9144446,0.002988314,0.0003489371,0.04828424,0.0003339446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9433782,0.002375513,0.01063882,0.002421992,0.0003510242,0.0003327878,0.000003343769,0.00003704409,0.04046125],"genre_scores_gemma":[0.979901,0.0004121614,0.01763868,0.00002630214,0.0002142561,8.226628e-7,0.000001031932,0.00003540632,0.001770322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08266855,"threshold_uncertainty_score":0.2422074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0678517191682732,"score_gpt":0.3429520143905892,"score_spread":0.275100295222316,"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."}}