{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100532,0.001297529,0.0008050392,0.0008994923,0.0004568042,0.001100402,0.001766935,0.001084827,0.005955251],"category_scores_gemma":[0.003309615,0.0006099176,0.00101501,0.001386354,0.0007007572,0.001675297,0.001189564,0.002025833,0.001081173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009864123,"about_ca_system_score_gemma":0.001982281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006615838,"about_ca_topic_score_gemma":0.006759384,"domain_scores_codex":[0.9991836,0.0001967697,0.00003958635,0.0001248426,0.0003658512,0.00008949569],"domain_scores_gemma":[0.9991572,0.0004735561,0.00008926633,0.00008188361,0.0001654,0.00003274346],"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.00003734267,0.00006336145,0.0002832922,0.0002152089,0.00003807295,0.00005316958,0.0000668771,0.8419381,0.00113003,0.0513104,0.004039279,0.1008249],"study_design_scores_gemma":[0.00001191376,0.00001758401,0.00002906903,0.00001461786,0.000005437389,0.00001530663,0.00001150536,0.9863929,0.0001910085,0.01043304,0.00287327,0.000004355686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002694203,0.0005003571,0.9911855,0.0001376033,0.00006896359,0.00005452484,0.00007449599,0.0003023678,0.004981969],"genre_scores_gemma":[0.103527,0.001038958,0.888534,0.0002911424,0.0001147939,0.0003947004,0.0004391598,0.0003491057,0.005311044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006615838,"threshold_uncertainty_score":0.01992232,"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."}}