{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293204,0.00008740347,0.00008944868,0.0001072736,0.000802107,0.0002845744,0.0001567262,0.00006479581,0.00002114938],"category_scores_gemma":[0.0002279211,0.00007120371,0.00002994828,0.0004193943,0.00007711845,0.0001517122,0.00005022482,0.0002687083,0.00001819352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005490217,"about_ca_system_score_gemma":0.00004509345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002582993,"about_ca_topic_score_gemma":0.000353205,"domain_scores_codex":[0.9989372,0.0001164372,0.0001974751,0.0001750596,0.0002361555,0.0003376467],"domain_scores_gemma":[0.9987558,0.0007071099,0.000005535353,0.0002177663,0.0002669256,0.00004684213],"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.000001653108,0.00001534493,0.0002078818,0.00001861815,0.0000127059,3.388702e-7,0.0001228458,0.9339142,0.00908124,0.0008451438,0.0002452003,0.05553477],"study_design_scores_gemma":[0.0003638648,0.00001603425,0.0004608628,0.00001222771,0.000004737919,0.000003390074,0.00007708152,0.9892592,0.007669643,0.000144864,0.001901497,0.00008664245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03503942,0.0005422738,0.9619544,0.0006527312,0.00006014466,0.0008220011,0.00001756636,0.0001569319,0.0007545283],"genre_scores_gemma":[0.4590064,0.00004879423,0.539563,0.00001292157,0.0001865606,0.00038931,0.00001600713,0.00003592582,0.0007410684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.423967,"threshold_uncertainty_score":0.6169239,"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."}}