{"id":"W1991670069","doi":"10.1016/s0166-218x(01)00268-2","title":"Domination analysis of some heuristics for the traveling salesman problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Southern Taiwan Science Park","keywords":"Travelling salesman problem; Digraph; Mathematics; Combinatorics; Heuristics; Bottleneck traveling salesman problem; Integer (computer science); Christofides algorithm; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562747,0.0001384111,0.0003070358,0.0001935281,0.0001705408,0.00007069366,0.0009215983,0.0000481724,0.00001238844],"category_scores_gemma":[0.00008766945,0.00009657246,0.0001676944,0.001033113,0.0001215434,0.0001316218,0.0001377436,0.0001052718,0.000008303384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002216594,"about_ca_system_score_gemma":0.000008954438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.95535e-7,"about_ca_topic_score_gemma":0.00000186898,"domain_scores_codex":[0.9986629,0.00001670359,0.0004196504,0.0002481582,0.0003837033,0.0002689032],"domain_scores_gemma":[0.9977232,0.001132409,0.0002468465,0.0007404311,0.0001085298,0.00004854027],"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.000003966336,0.00006173996,0.000003026776,0.0001065231,0.0002467515,3.192821e-7,0.00226867,0.003223466,0.00184577,0.9845785,0.00004601512,0.007615211],"study_design_scores_gemma":[0.0001937621,0.00002105991,0.00002244583,0.000009097212,0.0002164007,5.764804e-7,0.0002079792,0.663431,0.002194161,0.3335065,0.00009495572,0.0001020645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002035697,0.00009522102,0.9950454,0.0002124795,0.00002334325,0.0006625003,0.00001767181,0.00005349378,0.001854155],"genre_scores_gemma":[0.5718787,0.000053574,0.4276733,0.0000359453,0.00002453642,0.0001607727,0.00000804145,0.00001768862,0.0001474606],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6602075,"threshold_uncertainty_score":0.3938111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03373754081539889,"score_gpt":0.289320133767459,"score_spread":0.2555825929520602,"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."}}