{"id":"W2051358678","doi":"10.1287/opre.1060.0283","title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":672,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Travelling salesman problem; Vehicle routing problem; Computer science; Integer programming; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Branch and price; 2-opt; Traveling purchaser problem; Algorithm; Mathematics; Computer network","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.001750509,0.001962798,0.002078095,0.001601548,0.001473163,0.002134279,0.002151936,0.002156107,0.009167028],"category_scores_gemma":[0.004261853,0.001070178,0.001147807,0.002727111,0.000716779,0.002395436,0.001715556,0.003264948,0.001729709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554235,"about_ca_system_score_gemma":0.00317965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006243069,"about_ca_topic_score_gemma":0.005555004,"domain_scores_codex":[0.9987479,0.0004076315,0.00006786813,0.0002659484,0.0003327074,0.0001779225],"domain_scores_gemma":[0.9983186,0.001147755,0.000118353,0.0000858784,0.0002325553,0.00009701683],"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.0002518666,0.0005234029,0.0006586224,0.0003535248,0.0001073546,0.0002298158,0.0001643839,0.5081094,0.002203861,0.0439832,0.01790589,0.4255087],"study_design_scores_gemma":[0.0001086192,0.00009192489,0.0001154471,0.00002976062,0.00003001435,0.00008673776,0.00004944785,0.9654167,0.0008860001,0.0276449,0.005524298,0.0000161453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004923471,0.0003663048,0.9894642,0.0003037144,0.00007065165,0.0002735541,0.0001850186,0.0005354437,0.003877584],"genre_scores_gemma":[0.03571329,0.0003505124,0.9599584,0.0001291871,0.00004856103,0.0004847005,0.0006215429,0.0002064232,0.002487418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009167028,"threshold_uncertainty_score":0.03066671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04499379721732293,"score_gpt":0.3588639218862965,"score_spread":0.3138701246689736,"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."}}