{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638467,0.001118638,0.001261793,0.001298784,0.0007567017,0.001033064,0.00190173,0.001869587,0.009156751],"category_scores_gemma":[0.002888724,0.0006595401,0.0006697129,0.001824005,0.0006744681,0.001672679,0.0009884575,0.001364126,0.00096521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262149,"about_ca_system_score_gemma":0.001767095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004916315,"about_ca_topic_score_gemma":0.00437877,"domain_scores_codex":[0.9992458,0.0003628651,0.00003536022,0.0001219141,0.0001178812,0.0001161444],"domain_scores_gemma":[0.9982837,0.001303084,0.0001060357,0.00006865888,0.0001434979,0.00009501708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004453743,0.0005917134,0.0008573974,0.0002695702,0.00006111225,0.0002007418,0.0001686564,0.7046635,0.001418865,0.03287037,0.01307443,0.2453783],"study_design_scores_gemma":[0.0001090839,0.0001014883,0.0001548759,0.00001508897,0.00001176503,0.0000431439,0.00002601311,0.9818717,0.0004655444,0.01590513,0.001288272,0.000007865792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08450854,0.0007314629,0.8966916,0.0008144614,0.0001073856,0.0006351207,0.0006067905,0.001295585,0.01460908],"genre_scores_gemma":[0.2479042,0.0002509423,0.7439399,0.0001841521,0.00007068014,0.000553246,0.001281311,0.0001939354,0.005621605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009156751,"threshold_uncertainty_score":0.03063244,"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."}}