{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009641722,0.0001876258,0.0001927376,0.00008425561,0.0004336225,0.0001677771,0.0001969065,0.00006562645,0.000007216565],"category_scores_gemma":[0.00002795349,0.0001167311,0.00006303709,0.0001575324,0.00003652063,0.0002346441,0.00003064136,0.0004614228,0.000003194998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000521948,"about_ca_system_score_gemma":0.00003085662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007544641,"about_ca_topic_score_gemma":0.000004564747,"domain_scores_codex":[0.998905,0.00001516908,0.0004186283,0.0001118509,0.0001880968,0.0003612405],"domain_scores_gemma":[0.9991472,0.000329114,0.0001554323,0.0001338524,0.0001267278,0.0001076282],"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.00004991664,0.00001070498,0.001072497,0.00003271628,0.00009581151,0.000003462313,0.003104406,0.5924382,0.00002329404,0.0001569635,0.00002884898,0.4029832],"study_design_scores_gemma":[0.001847169,0.0001459805,0.001233239,0.0001592926,0.00002446093,0.0002323618,0.0002457353,0.9940172,0.001037338,0.0001199895,0.0007370047,0.0002001634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05973336,0.00006882583,0.937962,0.0000287775,0.0002419697,0.0003242717,0.000002108374,0.0001703708,0.001468319],"genre_scores_gemma":[0.5077121,0.00002066763,0.4919168,0.00007762592,0.0001991345,0.000005533726,0.000001166681,0.00004175644,0.00002523882],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4479787,"threshold_uncertainty_score":0.4760156,"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."}}