{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940155,0.001157926,0.001168894,0.001510036,0.0009035174,0.002088822,0.002120108,0.001826417,0.006565272],"category_scores_gemma":[0.00742735,0.0007468805,0.001873316,0.003267729,0.001647166,0.005759165,0.002508359,0.003384969,0.001107488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009268721,"about_ca_system_score_gemma":0.001146391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002233524,"about_ca_topic_score_gemma":0.001889212,"domain_scores_codex":[0.9988859,0.0004581076,0.00006282871,0.0002132324,0.0002639279,0.0001160448],"domain_scores_gemma":[0.9969525,0.001794393,0.0004782707,0.0002215648,0.0003637391,0.0001894277],"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.0001007905,0.0001640498,0.0005689543,0.0002594035,0.00005142677,0.000190565,0.0002394439,0.1533604,0.0006422565,0.8015001,0.009420374,0.03350231],"study_design_scores_gemma":[0.00002189007,0.00006314476,0.0004023308,0.00005072315,0.00002379737,0.0002499846,0.0001709449,0.3344413,0.0001537798,0.6553419,0.009055911,0.00002434304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192412,0.01222974,0.7608086,0.004115259,0.0005913764,0.0001146015,0.0008147176,0.0001750171,0.1019094],"genre_scores_gemma":[0.6865389,0.01879542,0.2293781,0.0008875829,0.002403017,0.0003588003,0.00138729,0.0002671244,0.05998363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006565272,"threshold_uncertainty_score":0.021963,"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."}}