{"id":"W2108904442","doi":"10.1007/3-540-47867-1_7","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Conjecture; Hamiltonian path; Hamiltonian (control theory); Combinatorics; Graph; Relaxation (psychology); Computer science; Exponential function; Combinatorial optimization; Metric (unit); Exact solutions in general relativity; Upper and lower bounds; Mathematics; Discrete mathematics; Algorithm; Mathematical optimization","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.002317339,0.001388111,0.002112778,0.002216663,0.001422301,0.003149928,0.003474323,0.001864725,0.01201231],"category_scores_gemma":[0.02373478,0.00113857,0.001099063,0.001929531,0.003103626,0.01144233,0.003256926,0.006442563,0.0008706672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002207727,"about_ca_system_score_gemma":0.001280462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008585055,"about_ca_topic_score_gemma":0.0007907064,"domain_scores_codex":[0.9990969,0.0002360856,0.00003556754,0.0001980922,0.0002311716,0.0002021351],"domain_scores_gemma":[0.9858528,0.01198095,0.0004911922,0.00054172,0.0004382631,0.0006950381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000478939,0.0003608384,0.001215692,0.000662118,0.00006752663,0.0001573978,0.0005061378,0.05038476,0.002874566,0.8846143,0.009650722,0.04902702],"study_design_scores_gemma":[0.00003647189,0.00004653944,0.0003089009,0.00005736571,0.00003211897,0.00009705815,0.0001272008,0.1022492,0.0007513496,0.8945017,0.001776807,0.00001540344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4220023,0.005987627,0.4263925,0.006284885,0.0007746766,0.0001833392,0.0006102663,0.00111478,0.1366495],"genre_scores_gemma":[0.9063125,0.002368683,0.07505626,0.0006788234,0.0005447149,0.000258287,0.0006105319,0.0005660914,0.01360415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01201231,"threshold_uncertainty_score":0.04018515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08844292964791423,"score_gpt":0.3061517458700606,"score_spread":0.2177088162221463,"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."}}