{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073204,0.0008155361,0.0008066007,0.0004366928,0.0009542315,0.002092195,0.001095108,0.001367554,0.008090327],"category_scores_gemma":[0.001626276,0.0004061029,0.000511111,0.00104185,0.0008142526,0.002201834,0.0009466729,0.001068938,0.001139582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008619422,"about_ca_system_score_gemma":0.002368456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005052747,"about_ca_topic_score_gemma":0.003636536,"domain_scores_codex":[0.9993325,0.0002179219,0.00002522973,0.0001518085,0.0001320702,0.0001403913],"domain_scores_gemma":[0.9996112,0.0001997574,0.00004996995,0.00002763342,0.00005469346,0.00005680791],"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.0003193396,0.0002328,0.0008779889,0.0004225851,0.00009652114,0.0006523772,0.0002623839,0.3421476,0.003262191,0.4484654,0.03719445,0.1660664],"study_design_scores_gemma":[0.00009783702,0.000127431,0.0003671498,0.00006232859,0.00005030607,0.0002948781,0.0002948552,0.6764389,0.002159806,0.2630191,0.05704893,0.00003842268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06921074,0.002115179,0.8248687,0.002956018,0.0004805659,0.0004744492,0.0016991,0.0005831446,0.09761205],"genre_scores_gemma":[0.6153796,0.003905995,0.3055801,0.001028331,0.0003376862,0.0005611684,0.002539995,0.0002818293,0.07038533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008090327,"threshold_uncertainty_score":0.0270648,"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."}}