{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003540454,0.0001060018,0.0001065956,0.00002165935,0.0001065258,0.00002606595,0.0001097086,0.00008554084,0.00002739974],"category_scores_gemma":[0.00001554086,0.00008400987,0.00003668484,0.0001188936,0.00003075871,0.00006759416,0.00002967991,0.0001532548,0.0000027649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001627578,"about_ca_system_score_gemma":0.000005134834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007119139,"about_ca_topic_score_gemma":0.000004288835,"domain_scores_codex":[0.9994245,0.00002895199,0.0001394788,0.0001252771,0.00005305334,0.0002287528],"domain_scores_gemma":[0.9995269,0.0002218379,0.00002786108,0.0001464308,0.0000367159,0.00004022043],"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.000005056726,0.000006251169,0.0001862673,0.00002052351,0.00007800533,4.249503e-7,0.001405984,0.3885845,0.00001014009,0.0002999984,0.0008937119,0.6085091],"study_design_scores_gemma":[0.0002136018,0.00001838771,0.0006697236,0.00002770952,0.00002508083,0.000004002861,0.00003653916,0.9967865,0.00009213484,0.0003717873,0.001645433,0.0001090523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002402125,0.0008344799,0.9941282,0.00002109015,0.0002539942,0.0004185401,0.000002225837,0.0002558417,0.003845473],"genre_scores_gemma":[0.1465939,0.0002300506,0.852031,0.00010925,0.0004378869,0.000217521,0.000004223956,0.0000695964,0.0003065371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6084,"threshold_uncertainty_score":0.3425823,"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."}}