{"id":"W6891564556","doi":"10.4230/lipics.cp.2025.30","title":"Exact Methods for the Travelling Salesperson Problem with Self-Deleting Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Vertex (graph theory); Solver; Preprocessor; Integer programming; Linear programming; Constraint programming; Dependency graph; Simple (philosophy)","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.001683379,0.001375909,0.001186817,0.0009540107,0.0005047351,0.001475,0.002143419,0.001403614,0.006470787],"category_scores_gemma":[0.004962747,0.000750541,0.001116743,0.001542972,0.0008271726,0.001789708,0.001158334,0.002273977,0.0009314127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001509852,"about_ca_system_score_gemma":0.00231289,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008659228,"about_ca_topic_score_gemma":0.01013614,"domain_scores_codex":[0.9991738,0.0003437492,0.00003351284,0.0001490998,0.0001957483,0.0001041643],"domain_scores_gemma":[0.9975216,0.001887821,0.0001781623,0.0001481039,0.0001936353,0.00007070586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003696937,0.00006521459,0.0002522464,0.0001743932,0.00003611424,0.00004103821,0.00004127291,0.9296945,0.0003248897,0.02673767,0.001861971,0.04073371],"study_design_scores_gemma":[0.00001166367,0.00001318184,0.00003375549,0.00001510529,0.000005321889,0.000009480572,0.00001582809,0.9842395,0.0001025045,0.01469224,0.0008583251,0.000003195447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008075647,0.0008399611,0.9842001,0.0002777767,0.00006103185,0.0000964941,0.000141695,0.0003326179,0.005974737],"genre_scores_gemma":[0.2038304,0.001111812,0.7873941,0.0002233712,0.0001219979,0.0003660243,0.0005041828,0.0004411855,0.006006953],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008659228,"threshold_uncertainty_score":0.02164698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01208885112058286,"score_gpt":0.2937752443041255,"score_spread":0.2816863931835427,"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."}}