{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055037,0.001123495,0.001376124,0.003527832,0.00183132,0.003092941,0.002654608,0.001326603,0.008282519],"category_scores_gemma":[0.02159107,0.0007971438,0.001610774,0.003419623,0.001817768,0.003398175,0.001096306,0.002088129,0.000475115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004052615,"about_ca_system_score_gemma":0.003419756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007387179,"about_ca_topic_score_gemma":0.006658412,"domain_scores_codex":[0.9979096,0.0007917633,0.00007162559,0.0002348257,0.0004151753,0.0005769993],"domain_scores_gemma":[0.9767379,0.01883881,0.001211581,0.001022699,0.001456109,0.0007327643],"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.001122172,0.0007041327,0.005977359,0.0005569708,0.0002792217,0.0002846025,0.0007676904,0.5728199,0.006480659,0.3105684,0.01486989,0.08556894],"study_design_scores_gemma":[0.00009978666,0.0001482303,0.001434418,0.00004674516,0.0001095478,0.0001020455,0.0001575847,0.8879444,0.001220413,0.1064373,0.00226835,0.00003120862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5903932,0.002686923,0.3362325,0.002449659,0.0001372993,0.0005661062,0.0008980953,0.0006121164,0.06602401],"genre_scores_gemma":[0.9112284,0.001172377,0.07410786,0.0003908071,0.0001718057,0.0003449884,0.0008452286,0.0002774787,0.01146104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008282519,"threshold_uncertainty_score":0.02940387,"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."}}