{"id":"W2042221491","doi":"10.1002/nav.20361","title":"A branch‐and‐cut algorithm for the nonpreemptive swapping problem","year":2009,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Object (grammar); Algorithm; Computer science; Type (biology); Graph; State (computer science); Set (abstract data type); Mathematical optimization; Mathematics; Combinatorics; Theoretical computer science; 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.0008697589,0.0001820139,0.0001834828,0.0001254213,0.0004158225,0.0001309168,0.0002786035,0.0001290941,0.00001021304],"category_scores_gemma":[0.0008401233,0.000141659,0.00004805746,0.0002220723,0.0002278023,0.00008891357,0.00006474387,0.000588337,0.00001766707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251296,"about_ca_system_score_gemma":0.00004161648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002394589,"about_ca_topic_score_gemma":0.00001333455,"domain_scores_codex":[0.9984013,0.00004642973,0.0002251946,0.0002814327,0.0004035528,0.0006420419],"domain_scores_gemma":[0.9979272,0.001332985,0.00002899976,0.0002913102,0.0002975991,0.0001218994],"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.00004135948,0.00004279408,0.000005566354,0.00009740818,0.0000572239,0.000009898223,0.0003835137,0.5036429,0.0003562552,0.01286803,0.002595702,0.4798994],"study_design_scores_gemma":[0.0006093343,0.0003223606,0.0003117878,0.00005826091,0.00002427282,0.00000868064,0.00012148,0.8968198,0.002200234,0.08558281,0.01366054,0.0002803845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00009657888,0.0008113518,0.9917936,0.0003052112,0.0001468879,0.0007462753,0.00005307319,0.0002121838,0.005834842],"genre_scores_gemma":[0.8510668,0.001353649,0.1458084,0.00007220913,0.0004451611,0.0001447599,0.00003807454,0.00005057328,0.001020326],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8509702,"threshold_uncertainty_score":0.5776685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06138552378114991,"score_gpt":0.3446818208832558,"score_spread":0.2832962971021059,"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."}}