{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224477,0.0001102969,0.0001624422,0.0002917816,0.0001817043,0.0001782732,0.0002221505,0.0001103047,0.00007434417],"category_scores_gemma":[0.000390454,0.0001085241,0.00005348984,0.0003477292,0.0001435914,0.00029062,0.00003407482,0.0003919568,0.000004640194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001309243,"about_ca_system_score_gemma":0.00008121122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007413854,"about_ca_topic_score_gemma":0.0003181178,"domain_scores_codex":[0.9987593,0.0001632411,0.0002827045,0.000210422,0.0002485669,0.0003357392],"domain_scores_gemma":[0.9984454,0.0001795095,0.00001166094,0.0003495142,0.0008679154,0.0001459795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002424964,0.0001871285,0.0002520703,0.0001485513,0.00008035546,0.000001285362,0.001296714,0.1411255,0.1241296,0.001613991,0.001366595,0.729774],"study_design_scores_gemma":[0.0002418368,0.0001762105,0.0001501756,0.00002322857,0.000002921528,0.000001759441,0.0001819359,0.9078565,0.09031888,0.00009969332,0.0008400726,0.0001068419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1669431,0.00004290664,0.83047,0.001267431,0.0001620622,0.0006928781,0.00003297127,0.0001294769,0.0002591589],"genre_scores_gemma":[0.6930179,0.00002222319,0.3064849,0.00003877304,0.00006884748,0.0001884705,0.0000613879,0.00003668903,0.00008084996],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.766731,"threshold_uncertainty_score":0.4425485,"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."}}