{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338856,0.001042943,0.001622733,0.00111375,0.001113349,0.002899801,0.002311798,0.002244476,0.005411271],"category_scores_gemma":[0.004457389,0.001090654,0.001507058,0.002321959,0.001678938,0.003885322,0.001967703,0.003299382,0.001073345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001798805,"about_ca_system_score_gemma":0.0022715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00734591,"about_ca_topic_score_gemma":0.005695086,"domain_scores_codex":[0.9993609,0.0002602022,0.00002566424,0.0001181091,0.0001826766,0.00005260267],"domain_scores_gemma":[0.9986737,0.0008633873,0.00009581899,0.0001157109,0.0001861422,0.00006518205],"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.00004604608,0.00008392947,0.0002624466,0.0001466002,0.00003350716,0.00003507621,0.00007904213,0.6569155,0.0004291825,0.2784089,0.007432478,0.05612717],"study_design_scores_gemma":[0.000008134808,0.000009314256,0.00003719245,0.00001665136,0.000006138186,0.00001270231,0.00002140213,0.8961737,0.0001457302,0.1003536,0.003208429,0.000006999639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003546724,0.0006747264,0.9893828,0.0004439824,0.00009736721,0.00003076182,0.00007147463,0.00007748487,0.005674632],"genre_scores_gemma":[0.1447851,0.003112264,0.8365493,0.0002377201,0.0002814255,0.0003498748,0.0004829236,0.0003082646,0.01389308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00734591,"threshold_uncertainty_score":0.01810247,"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."}}