{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001297509,0.000326548,0.0007864463,0.000212176,0.00009801871,0.0001385769,0.000594368,0.0003957625,0.00002357565],"category_scores_gemma":[0.0004579471,0.0002805991,0.000423346,0.000307016,0.00005222447,0.0001731331,0.0001012677,0.0008352393,4.721041e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535668,"about_ca_system_score_gemma":0.000277075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002689417,"about_ca_topic_score_gemma":1.796691e-7,"domain_scores_codex":[0.9972193,0.0002297459,0.001601572,0.0001910186,0.0005297282,0.0002286452],"domain_scores_gemma":[0.996764,0.0006178374,0.001416984,0.0002865163,0.0008004451,0.0001141889],"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.0001429197,0.00005379018,0.00001563198,0.0005390737,0.0003357763,0.000001620548,0.000756124,0.9935415,0.0004989662,0.002983569,0.0003329655,0.0007981117],"study_design_scores_gemma":[0.001702482,0.0001996599,0.00001505798,0.0003359599,0.0004533539,0.000008331004,0.00007159974,0.9871587,0.002198314,0.007407746,0.0002033668,0.0002454573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009225056,0.0004325925,0.9885948,0.0004526672,0.008464465,0.0008179355,0.00001839996,0.00007432578,0.0002223185],"genre_scores_gemma":[0.4048018,0.0004485663,0.5928011,0.00001882166,0.001736845,0.00002909805,0.00003139513,0.000124424,0.000007942904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4038793,"threshold_uncertainty_score":0.9999646,"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."}}