{"id":"W2134465458","doi":"10.1002/net.20447","title":"A branch‐and‐cut algorithm for the preemptive swapping problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; HEC Montréal","funders":"","keywords":"Vertex (graph theory); Algorithm; Computer science; Graph; Integer programming; Branch and cut; Object (grammar); Combinatorics; Integer (computer science); Mathematics; Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316355,0.001300187,0.001457078,0.001151029,0.0008823561,0.001116166,0.00175176,0.001740013,0.008412174],"category_scores_gemma":[0.002603465,0.0007406421,0.0007452062,0.001695587,0.0006481675,0.001434359,0.001177649,0.001983736,0.0009707183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382451,"about_ca_system_score_gemma":0.002167871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005766249,"about_ca_topic_score_gemma":0.005041005,"domain_scores_codex":[0.9993256,0.0002689839,0.00002738159,0.0001304993,0.0001336601,0.0001138491],"domain_scores_gemma":[0.9986594,0.0009714519,0.00009047698,0.0000632764,0.0001277976,0.00008771865],"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.000269896,0.000348441,0.0004875107,0.0001662039,0.00005348777,0.0001268367,0.00009095384,0.7800913,0.001066667,0.024381,0.009426748,0.1834909],"study_design_scores_gemma":[0.00006353843,0.00004177317,0.0000513213,0.000007963682,0.000007357661,0.00001983262,0.00001315518,0.9880562,0.0002621714,0.01049509,0.0009776374,0.000004038115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02854235,0.0004929569,0.9619425,0.0004806378,0.00008547683,0.0002790321,0.0002535744,0.0009050329,0.007018424],"genre_scores_gemma":[0.181923,0.0002721545,0.8115914,0.0001739692,0.00006820649,0.0005220374,0.0007586207,0.000239858,0.004450741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008412174,"threshold_uncertainty_score":0.02814156,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02521659239295936,"score_gpt":0.2373127055482904,"score_spread":0.212096113155331,"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."}}