{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00107703,0.0008803743,0.00103793,0.0005118355,0.0005268388,0.001189063,0.001091716,0.00134639,0.007709117],"category_scores_gemma":[0.003041095,0.0006403389,0.0007344235,0.001118397,0.0006020336,0.001101388,0.000658624,0.001559764,0.0004694135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00208737,"about_ca_system_score_gemma":0.00294695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01404608,"about_ca_topic_score_gemma":0.01190128,"domain_scores_codex":[0.9994777,0.0001983865,0.00001868577,0.0001116038,0.00009286341,0.0001007881],"domain_scores_gemma":[0.9983455,0.001286793,0.0001226202,0.00005665315,0.00009780482,0.00009065001],"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.00006197135,0.00005196927,0.0003761255,0.00007110988,0.00001644597,0.00006344604,0.0000275879,0.9761484,0.0005086698,0.008887507,0.001467023,0.01231974],"study_design_scores_gemma":[0.00002347869,0.0000254568,0.0001116738,0.000005330526,0.000006113379,0.000020327,0.00001832976,0.9918611,0.0002274295,0.006968511,0.0007284198,0.000003799788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08518552,0.0004481756,0.8981349,0.0009381137,0.0000774177,0.0002346879,0.0006772165,0.0003628275,0.01394111],"genre_scores_gemma":[0.4547311,0.0004857281,0.5366458,0.0002028719,0.00005201959,0.0003505489,0.001067316,0.0001882374,0.006276406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01404608,"threshold_uncertainty_score":0.02792865,"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."}}