{"id":"W2080484716","doi":"10.1007/s12532-012-0047-y","title":"The time dependent traveling salesman problem: polyhedra and algorithm","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Polytope; Bottleneck traveling salesman problem; Polyhedron; Theory of computation; Mathematics; Combinatorics; Generalization; Dimension (graph theory); Heuristics; Traveling purchaser problem; Combinatorial optimization; Algorithm; Computer science; Mathematical optimization","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.001063575,0.0001402565,0.0001425555,0.0000331321,0.0002134526,0.0001747061,0.0000797638,0.00006638483,0.000006933495],"category_scores_gemma":[0.00007713698,0.0001100297,0.00003093589,0.0001394687,0.00005462104,0.0001473699,0.00003583114,0.000148031,0.00006479768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004204294,"about_ca_system_score_gemma":0.000005508367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.894317e-7,"about_ca_topic_score_gemma":1.594508e-7,"domain_scores_codex":[0.9989232,0.00008266327,0.0003129728,0.0001126399,0.0002082547,0.0003602461],"domain_scores_gemma":[0.9992922,0.0004061742,0.0000479612,0.0001013699,0.00003768688,0.0001146242],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001370772,0.00004126991,0.00006068383,0.0001124173,0.00003254871,8.626291e-7,0.001172606,0.02672487,0.0001554982,0.001561052,0.00002868728,0.9701082],"study_design_scores_gemma":[0.0001500004,0.00001616215,0.0001264611,0.00003598403,0.00002533448,0.00003465897,0.00008278693,0.9935784,0.0001865292,0.005355887,0.0002626256,0.0001451616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01010128,0.0002644177,0.9878296,0.00008346677,0.00008701938,0.00035348,6.307391e-7,0.0004938216,0.0007862769],"genre_scores_gemma":[0.2512236,0.000006191541,0.7485319,0.000009563853,0.00009205664,0.00003174607,0.000006326331,0.00003833262,0.00006031785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.969963,"threshold_uncertainty_score":0.448688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01327064375382853,"score_gpt":0.2620524660477406,"score_spread":0.248781822293912,"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."}}