{"id":"W4414223321","doi":"10.1609/icaps.v35i1.36134","title":"New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Travelling salesman problem; Integer programming; Generalization; Quadratic programming; Quadratic equation; Branch and bound; Scalability; Integer (computer science); Linear programming","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.001144426,0.0001499067,0.0002103311,0.0002364921,0.0002100498,0.0005437059,0.00117935,0.00007372729,0.000009246352],"category_scores_gemma":[0.001048027,0.0001183544,0.00005997344,0.0003444715,0.00003818991,0.0002749279,0.000266284,0.0002233885,9.676484e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004312636,"about_ca_system_score_gemma":0.00023458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001256052,"about_ca_topic_score_gemma":2.234452e-7,"domain_scores_codex":[0.9987035,0.00001820732,0.0003929481,0.0003603699,0.0003116098,0.0002133182],"domain_scores_gemma":[0.9985814,0.0003756486,0.0002455667,0.0001135574,0.000615222,0.00006856695],"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.00006952796,0.00005430136,0.001306463,0.000277087,0.0002211211,6.452354e-7,0.001755772,0.01027243,0.05511382,0.8709652,0.0009258459,0.05903773],"study_design_scores_gemma":[0.0003500557,0.00003435806,0.0003327237,0.0007524361,0.00001230818,0.000004924026,0.0001697198,0.9623834,0.01752592,0.01822778,0.00009895015,0.0001074333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008737129,0.00008704761,0.9784896,0.003610269,0.0003827116,0.0003286728,0.000002196935,0.0002723115,0.008090023],"genre_scores_gemma":[0.276573,0.00001087388,0.7225749,0.0001076789,0.00002625041,0.00001893891,0.000001593096,0.000007109369,0.0006797026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9521109,"threshold_uncertainty_score":0.5242969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05569454548912666,"score_gpt":0.3893306677458064,"score_spread":0.3336361222566798,"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."}}