{"id":"W2068748054","doi":"10.1016/j.disopt.2011.05.002","title":"Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Matching (statistics); Integer (computer science); Graph; Constructive; Mathematical optimization; Discrete mathematics; Graph coloring; Computer science; Statistics","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.0004603055,0.0009961687,0.0009609817,0.001017232,0.0007275851,0.001246634,0.001430854,0.001218484,0.007250597],"category_scores_gemma":[0.002650415,0.0005205205,0.0009229603,0.001686203,0.0005627021,0.001587075,0.001317433,0.001130288,0.0006309656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009005496,"about_ca_system_score_gemma":0.0009048368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003616553,"about_ca_topic_score_gemma":0.00401831,"domain_scores_codex":[0.9997036,0.00009080675,0.0000111408,0.00005318659,0.00007995713,0.00006134736],"domain_scores_gemma":[0.9995226,0.0003010497,0.00005280124,0.00005030604,0.0000454303,0.00002790889],"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.0003435812,0.000202574,0.0006400365,0.00033311,0.00005813263,0.000163391,0.0002092888,0.7735553,0.006892686,0.111339,0.003760052,0.1025029],"study_design_scores_gemma":[0.00003499975,0.00006702208,0.0001657577,0.00001645185,0.00001262318,0.00003741478,0.00004948991,0.9428978,0.001804327,0.05354968,0.001355367,0.000009009019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08711562,0.0001802409,0.8967322,0.0002256574,0.00005334091,0.0001441997,0.0002743212,0.0002330304,0.01504134],"genre_scores_gemma":[0.4520044,0.0002588343,0.536721,0.0001102744,0.00003561834,0.0002485632,0.0004708878,0.0001888574,0.009961507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007250597,"threshold_uncertainty_score":0.02425569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05271715870122828,"score_gpt":0.2790077682209249,"score_spread":0.2262906095196967,"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."}}