{"id":"W3034726805","doi":"10.1287/ijoc.2021.1119","title":"Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Bayerische Forschungsallianz","keywords":"Vehicle routing problem; Mathematical optimization; Scheduling (production processes); Computer science; Branch and price; Branch and cut; Synchronization (alternating current); Mathematics; Routing (electronic design automation); Linear programming; Computer network","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.0006754095,0.0001769235,0.0001974704,0.0001068335,0.0003817854,0.0003507535,0.00009082908,0.00007367351,0.000007763935],"category_scores_gemma":[0.00008465048,0.0001538573,0.00002921207,0.0003333341,0.00002214517,0.0003913447,0.0000342804,0.000344828,0.000005197141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001119942,"about_ca_system_score_gemma":0.00009350498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005632558,"about_ca_topic_score_gemma":0.000002878362,"domain_scores_codex":[0.9989711,0.00003089061,0.0003751462,0.0001584999,0.0001997436,0.0002646245],"domain_scores_gemma":[0.9988964,0.0002090418,0.0001639486,0.000129801,0.000477311,0.0001234929],"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.00001277542,0.00002143095,0.0007666238,0.0001837797,0.00007927128,0.000001681497,0.001395956,0.9660047,0.0005631605,0.000301583,0.0000100277,0.03065898],"study_design_scores_gemma":[0.001021438,0.0001451161,0.001455414,0.0004702115,0.00002497494,0.0003069069,0.0002408006,0.991798,0.00359668,0.0004517581,0.0002147536,0.0002738829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3143561,0.0001335967,0.6842967,0.0003519626,0.00009825822,0.0001828827,0.000002013235,0.0001356764,0.0004427913],"genre_scores_gemma":[0.7312649,0.00003236027,0.2682698,0.0002176065,0.0001393313,0.000005133462,0.000006063401,0.00003539388,0.00002934621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4169088,"threshold_uncertainty_score":0.627412,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0146424932360501,"score_gpt":0.2466068014624927,"score_spread":0.2319643082264426,"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."}}