{"id":"W1993464679","doi":"10.1016/j.jda.2006.03.004","title":"On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Heuristics; Travelling salesman problem; Heuristic; Consistent heuristic; Mathematics; Null-move heuristic; Algorithm; Mathematical optimization; Probabilistic logic; Matching (statistics); Set (abstract data type); Hamiltonian (control theory); Combinatorics; Computer science; Search algorithm; Incremental heuristic search","routes":{"ca_aff":true,"ca_fund":false,"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.00563868,0.0006342657,0.001295747,0.00212906,0.001826897,0.001884114,0.002765733,0.001827363,0.005266295],"category_scores_gemma":[0.04214465,0.0009450769,0.00119936,0.00183161,0.003266968,0.003189682,0.002239329,0.001634276,0.0003279808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002806561,"about_ca_system_score_gemma":0.002505781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004640621,"about_ca_topic_score_gemma":0.004807466,"domain_scores_codex":[0.9979028,0.001023184,0.00007357188,0.0002392942,0.0004727144,0.0002884604],"domain_scores_gemma":[0.9499377,0.04372235,0.001566741,0.002067147,0.001666576,0.001039526],"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.0005126331,0.00008979261,0.00208121,0.0001704899,0.0000865467,0.00007255481,0.000250634,0.794358,0.002524167,0.1781972,0.002217026,0.01943991],"study_design_scores_gemma":[0.00003173736,0.00003834103,0.0002885134,0.00001355007,0.00001372391,0.00002231917,0.00002570717,0.9535628,0.0003746647,0.04541604,0.0002017974,0.0000108724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3195437,0.0007572654,0.6659976,0.001255721,0.00008162569,0.0001418248,0.0002557822,0.0007329889,0.01123341],"genre_scores_gemma":[0.8779949,0.0003051732,0.1182131,0.0001698122,0.00005620345,0.0001355406,0.0003270245,0.0003716187,0.002426517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00563868,"threshold_uncertainty_score":0.0298205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01273892851071396,"score_gpt":0.2494105867855291,"score_spread":0.2366716582748151,"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."}}