{"id":"W1970974711","doi":"10.1287/opre.1050.0218","title":"The Black and White Traveling Salesman Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Combinatorics; Mathematics; Vertex (graph theory); Traveling purchaser problem; 2-opt; Bounded function; Vehicle routing problem; Branch and cut; Mathematical optimization; Hamiltonian path; Integer programming; Discrete mathematics; Graph; Computer science; Routing (electronic design automation)","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.001386115,0.00006069327,0.0000537945,0.00006402884,0.0006735293,0.0003703057,0.0001146224,0.00004299939,0.0000237422],"category_scores_gemma":[0.00007362287,0.0000478117,0.0000117964,0.0003660653,0.0001262242,0.00009562285,0.00003474618,0.0002558414,0.00004085998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000394491,"about_ca_system_score_gemma":0.00002856921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004929995,"about_ca_topic_score_gemma":0.0003244834,"domain_scores_codex":[0.9990836,0.0001687676,0.0001579673,0.0001164542,0.0002143757,0.0002588668],"domain_scores_gemma":[0.9994593,0.0001577157,0.00000304181,0.0001801522,0.0001609385,0.00003887135],"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":[9.435948e-7,0.000005584778,0.0006479214,0.00001113398,0.000004854232,6.62577e-7,0.0002413327,0.9866006,0.002928578,0.005038185,0.001257689,0.003262504],"study_design_scores_gemma":[0.0001085662,0.000009590062,0.00326503,0.00001010708,0.000001637081,0.000002907762,0.0001523408,0.9910462,0.0008904777,0.0002822595,0.00416259,0.00006829453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6063958,0.0005715982,0.2553174,0.003973988,0.0001333338,0.001140484,0.00001182311,0.0004756237,0.1319799],"genre_scores_gemma":[0.9145368,0.0001641769,0.07970709,0.000005981811,0.0001209561,0.00004901603,0.000009798116,0.0000293842,0.005376789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.308141,"threshold_uncertainty_score":0.5180311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03776718920947337,"score_gpt":0.3386011763200925,"score_spread":0.3008339871106191,"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."}}