{"id":"W2078190972","doi":"10.1002/net.20451","title":"The preemptive swapping problem on a tree","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Canada Research Chairs","keywords":"Vertex (graph theory); Object (grammar); Computer science; Tree (set theory); Heuristic; Mathematical optimization; Combinatorics; Mathematics; Routing (electronic design automation); Type (biology); Graph; Computer network; Artificial intelligence","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.0003243626,0.00009832941,0.00007769363,0.00002113108,0.0001180885,0.00002726972,0.0001521625,0.00007323929,0.00003328761],"category_scores_gemma":[0.00002232671,0.00007378469,0.00003331789,0.0001569836,0.00002494985,0.00004258022,0.00002203572,0.000220798,0.00003095854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003153686,"about_ca_system_score_gemma":0.000004598648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003199456,"about_ca_topic_score_gemma":0.00000927773,"domain_scores_codex":[0.9993812,0.00005933446,0.0001366695,0.0001054456,0.00007874237,0.0002386314],"domain_scores_gemma":[0.999551,0.0001482918,0.00002623369,0.0002108174,0.000023016,0.00004065318],"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.00001273434,0.00000830071,0.0003450554,0.00000486122,0.00003440553,0.000001631919,0.0007531767,0.8996783,0.00001212949,0.001773404,0.002477505,0.09489853],"study_design_scores_gemma":[0.0001432056,0.00003613174,0.0023286,0.00004120482,0.000008289625,0.000001750438,0.00004160964,0.9932489,0.0001806392,0.0004207887,0.003423686,0.0001252128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002801637,0.00030188,0.6954018,0.0000330539,0.0004624217,0.000261906,4.697885e-7,0.00061608,0.3001207],"genre_scores_gemma":[0.9093804,0.0001405331,0.08903843,0.00009251189,0.0003161139,0.00006763954,0.0000020913,0.0000683027,0.0008939152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9065788,"threshold_uncertainty_score":0.3008852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02547024920127391,"score_gpt":0.2263983107244418,"score_spread":0.2009280615231679,"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."}}