{"id":"W2125126715","doi":"10.1287/ijoc.1110.0489","title":"A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Ministero dell'Università e della Ricerca","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; 2-opt; Traveling purchaser problem; Pickup; Branch and cut; Mathematical optimization; Algorithm; Computer science; Path (computing); Mathematics; Branch and bound; Shortest path problem; Nearest neighbour algorithm; Combinatorial optimization; Hamiltonian path; Stack (abstract data type); Integer programming; Theoretical computer science; Graph; Artificial intelligence","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.001114501,0.001715725,0.001685503,0.001205838,0.001426348,0.001717293,0.001986586,0.001962919,0.01192886],"category_scores_gemma":[0.002626263,0.0009768426,0.001102339,0.002477041,0.0005210926,0.002312678,0.001630908,0.002423669,0.001901169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414026,"about_ca_system_score_gemma":0.003013035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008820892,"about_ca_topic_score_gemma":0.008912121,"domain_scores_codex":[0.9992612,0.0001698922,0.00004216499,0.0001956816,0.0001756275,0.0001554659],"domain_scores_gemma":[0.99896,0.0006558377,0.00008246423,0.00007959368,0.0001383613,0.00008380887],"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.0002620817,0.0004867713,0.0006022037,0.0002889971,0.00008560285,0.000212873,0.0001661581,0.5627932,0.002537061,0.02371156,0.01635092,0.3925025],"study_design_scores_gemma":[0.0001120318,0.000100164,0.0001379727,0.00002015575,0.00002436108,0.00007051909,0.00005813568,0.9787714,0.000806287,0.01609424,0.003790536,0.00001421734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01479153,0.0004422448,0.976014,0.0003569026,0.00008548023,0.0003519455,0.0003296669,0.001288096,0.006340229],"genre_scores_gemma":[0.06487407,0.0002665427,0.9299942,0.00009518611,0.0000449931,0.0004076526,0.000887387,0.000271398,0.003158619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01192886,"threshold_uncertainty_score":0.03990602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03182662460064117,"score_gpt":0.2557665983680457,"score_spread":0.2239399737674045,"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."}}