{"id":"W2155694204","doi":"10.1287/trsc.1120.0449","title":"Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem","year":2012,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Branch and cut; Bottleneck traveling salesman problem; Bounding overwatch; Mathematics; 2-opt; Traveling purchaser problem; Integer programming; Tree traversal; Branch and bound; Graph; Combinatorics; Hamiltonian path; Time complexity; Combinatorial optimization; Mathematical optimization; Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001225205,0.00007946468,0.0001040005,0.000129156,0.0002072152,0.00005461346,0.0001007525,0.0000268766,0.00001375574],"category_scores_gemma":[0.00001021677,0.00006393847,0.00003001124,0.0006987181,0.0001211449,0.000327493,0.000001938692,0.00005421134,0.000002027471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001406492,"about_ca_system_score_gemma":0.00001187123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008738562,"about_ca_topic_score_gemma":0.00001346073,"domain_scores_codex":[0.9992562,0.00001215854,0.0001759334,0.0001471558,0.0001965027,0.0002120845],"domain_scores_gemma":[0.9995829,0.0001467235,0.00003328375,0.00009974021,0.00005497404,0.00008237464],"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.000003766941,0.00001679946,0.02764801,0.00005159348,0.0001265384,2.252363e-7,0.008188063,0.663785,0.01163026,0.000569939,0.000004719748,0.2879751],"study_design_scores_gemma":[0.0001427723,0.000005794323,0.09547616,0.000004343101,0.0001820788,9.848304e-7,0.00007302087,0.8983482,0.005552477,0.00005401561,0.00005904926,0.0001011439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08173584,0.0001652551,0.9176428,0.00004282299,0.00005146506,0.0001868471,0.00001352721,0.0000842287,0.00007720567],"genre_scores_gemma":[0.8025653,0.00005193397,0.1972467,0.0000199948,0.00002464757,0.00001918296,0.000006534246,0.000009810644,0.00005594159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7208294,"threshold_uncertainty_score":0.2607335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01563645157465395,"score_gpt":0.270342152026532,"score_spread":0.2547057004518781,"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."}}