{"id":"W2098400882","doi":"10.1287/opre.1050.0240","title":"A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Linear programming relaxation; Branch and cut; Polytope; Scheduling (production processes); Branch and bound; Mathematical optimization; Mathematics; Variable (mathematics); Computer science; Cutting-plane method; Lagrangian relaxation; Integer programming; Algorithm; Combinatorics","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.0008237817,0.001111225,0.001057956,0.0009686604,0.0007776579,0.001121096,0.001152696,0.001271358,0.005371913],"category_scores_gemma":[0.002482865,0.0006296166,0.0006695662,0.001537884,0.0005002963,0.001270244,0.00117251,0.001735937,0.0007645871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050896,"about_ca_system_score_gemma":0.002082867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005811716,"about_ca_topic_score_gemma":0.005082166,"domain_scores_codex":[0.9995145,0.0001470313,0.00002022133,0.00008558002,0.0001371951,0.0000955389],"domain_scores_gemma":[0.9993029,0.0004921682,0.00004735982,0.00003808068,0.00007268848,0.00004680592],"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.0001638911,0.0002138803,0.0005429043,0.0001685659,0.00005721852,0.0001246161,0.0001152838,0.6900648,0.002121319,0.04096286,0.007370028,0.2580946],"study_design_scores_gemma":[0.00006513153,0.00005186933,0.0001022447,0.00001403596,0.00001595858,0.00003443022,0.0000248882,0.976922,0.0006469454,0.01959423,0.002521561,0.000006655636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0106251,0.0002699139,0.9842944,0.0002837365,0.00003068097,0.000131988,0.0001601545,0.000389215,0.003814789],"genre_scores_gemma":[0.08070508,0.0003517744,0.9162166,0.0000970578,0.00003305499,0.0002992235,0.0005147416,0.0001148174,0.001667625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005811716,"threshold_uncertainty_score":0.0179708,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05003228751600552,"score_gpt":0.3498177781946475,"score_spread":0.299785490678642,"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."}}