{"id":"W2145935606","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Computer science; Message passing; 2-opt; Cutting-plane method; Mathematical optimization; Optimization problem; Graph; Combinatorial optimization; Graph partition; Context (archaeology); Theoretical computer science; Bottleneck traveling salesman problem; Mathematics; Algorithm; Integer programming; Parallel computing","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.001761747,0.001265435,0.000861134,0.0007557872,0.0005818825,0.001053379,0.001528469,0.001334584,0.005535579],"category_scores_gemma":[0.00659395,0.0004430813,0.000942484,0.001038771,0.001230999,0.002407972,0.001628089,0.00194461,0.0008042894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009175731,"about_ca_system_score_gemma":0.0007709416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066741,"about_ca_topic_score_gemma":0.002058689,"domain_scores_codex":[0.9990965,0.0004797927,0.0000296843,0.0001445691,0.0001677322,0.00008181432],"domain_scores_gemma":[0.9976138,0.001613488,0.0002119452,0.000320657,0.00016853,0.00007158838],"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.0001353312,0.0001168372,0.0003660275,0.000213635,0.00004206935,0.0001402052,0.0002163036,0.7189717,0.003429298,0.1700648,0.00427509,0.1020287],"study_design_scores_gemma":[0.00001520468,0.000047453,0.0000483023,0.00001036792,0.000008953315,0.00002986112,0.00001744026,0.9501919,0.0009681729,0.04586436,0.002791486,0.000006599242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007445083,0.0001094053,0.9890035,0.0002085193,0.00003244381,0.00006465353,0.00004198708,0.0002163175,0.002878127],"genre_scores_gemma":[0.2601946,0.0003051496,0.732295,0.0001842581,0.0001178807,0.000459166,0.0002081539,0.0001801851,0.0060556],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005535579,"threshold_uncertainty_score":0.01851833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04590610047051673,"score_gpt":0.1944879409977994,"score_spread":0.1485818405272827,"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."}}