{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002340471,0.0004765354,0.0005074526,0.0003175127,0.0005825348,0.0003525221,0.0006061552,0.000236286,0.00001102267],"category_scores_gemma":[0.0001532638,0.0003552159,0.0002660684,0.0006819934,0.00008128748,0.0005080663,0.00007847238,0.000505538,0.00000645672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001678852,"about_ca_system_score_gemma":0.00007135081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005491233,"about_ca_topic_score_gemma":0.000005142567,"domain_scores_codex":[0.9975567,0.00009116819,0.00105122,0.0002482076,0.0002406271,0.0008120306],"domain_scores_gemma":[0.9973705,0.001411758,0.0002504171,0.0005667935,0.0002900657,0.0001104479],"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.0004092318,0.0002572966,0.003778843,0.00838538,0.002779228,0.000001854657,0.03358257,0.6857591,0.0007776532,0.01800609,0.003816512,0.2424463],"study_design_scores_gemma":[0.002243429,0.0001023701,0.0001093012,0.0003150674,0.0002230347,0.00001517319,0.002101611,0.9435756,0.00307306,0.0004420921,0.04732979,0.0004694664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006560007,0.0002284217,0.9848082,0.0002085972,0.0005454114,0.002447662,0.00008702678,0.0008704918,0.004244186],"genre_scores_gemma":[0.04360841,0.0001139269,0.9549117,0.0003560135,0.00008343018,0.0005085556,0.0001076161,0.0001211503,0.0001891644],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2578166,"threshold_uncertainty_score":0.99989,"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."}}