{"id":"W2015067034","doi":"10.1007/s10479-010-0806-y","title":"An interior-point Benders based branch-and-cut algorithm for mixed integer programs","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benders' decomposition; Branch and cut; Mathematics; Theory of computation; Cutting-plane method; Mathematical optimization; Integer programming; Integer (computer science); Branch and bound; Interior point method; Steiner tree problem; Facility location problem; Algorithm; Point (geometry); Linear programming relaxation; Computer science","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.002552222,0.00198773,0.002704013,0.001714331,0.000932608,0.001688063,0.002456239,0.002808473,0.00853279],"category_scores_gemma":[0.004634254,0.001696675,0.001674072,0.001870018,0.001031177,0.001888523,0.001947876,0.003985556,0.001579149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262976,"about_ca_system_score_gemma":0.00252905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004266895,"about_ca_topic_score_gemma":0.004712446,"domain_scores_codex":[0.9987687,0.0005063295,0.00005275271,0.0001653271,0.0003845357,0.000122231],"domain_scores_gemma":[0.9980674,0.001350503,0.0001133271,0.00008752463,0.0002874986,0.00009382647],"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.0003452065,0.0003702535,0.0003331511,0.00019474,0.00007445236,0.00005725423,0.000095681,0.7337119,0.002220223,0.02109672,0.005029635,0.2364708],"study_design_scores_gemma":[0.00004581809,0.00004899081,0.00003763595,0.00001490232,0.00001077898,0.000008861251,0.000007013932,0.9931977,0.0003446625,0.005533082,0.0007438234,0.000006713068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004061322,0.0001460268,0.992205,0.0001235115,0.00004970787,0.0001058346,0.0000605465,0.000425222,0.002822822],"genre_scores_gemma":[0.0439724,0.0001452487,0.952143,0.0001018857,0.00004798673,0.0003689947,0.0002192408,0.0002179751,0.002783253],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00853279,"threshold_uncertainty_score":0.02854502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1365524725644542,"score_gpt":0.441505552289733,"score_spread":0.3049530797252788,"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."}}