{"id":"W2615340271","doi":"10.1007/s10878-020-00588-y","title":"A class of exponential neighbourhoods for the quadratic travelling salesman problem","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian path; Combinatorics; Travelling salesman problem; Mathematics; Quadratic equation; Digraph; Exponential function; Rank (graph theory); Heuristics; Discrete mathematics; Time complexity; Shortest path problem; Graph; Mathematical optimization; Mathematical analysis","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.001029884,0.0004596747,0.0008628137,0.0009019914,0.001129493,0.00162222,0.001352314,0.001085253,0.00699099],"category_scores_gemma":[0.007475439,0.0004357151,0.0009788334,0.0007199946,0.001206915,0.002181463,0.001995784,0.001814426,0.000533895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008154197,"about_ca_system_score_gemma":0.0004600855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001806005,"about_ca_topic_score_gemma":0.001387363,"domain_scores_codex":[0.9995266,0.0001495508,0.00002186933,0.0001021597,0.0001272302,0.00007250381],"domain_scores_gemma":[0.9973142,0.001694925,0.0002488879,0.0001430881,0.0003225081,0.0002764342],"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.0002066071,0.0001025164,0.001541547,0.0001420561,0.0000369291,0.0002499784,0.0002535239,0.07760127,0.001378751,0.8940413,0.004638408,0.01980711],"study_design_scores_gemma":[0.00006056676,0.00008865212,0.0008894755,0.00003654111,0.00001382261,0.000266691,0.00015027,0.4842366,0.0003879048,0.5075894,0.006252527,0.00002746231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4168575,0.00173512,0.5114479,0.001154325,0.000238412,0.0001413389,0.0004990047,0.0002125658,0.06771391],"genre_scores_gemma":[0.9174817,0.001243658,0.04743581,0.0001957105,0.000197875,0.0001606171,0.0007967513,0.0001611857,0.0323266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00699099,"threshold_uncertainty_score":0.02338719,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02603628727455053,"score_gpt":0.2718217439551514,"score_spread":0.2457854566806009,"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."}}