{"id":"W2096788301","doi":"10.1287/ijoc.1110.0458","title":"Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Innovation Foundation","keywords":"Mathematical optimization; Benders' decomposition; Integer programming; Tabu search; Decomposition; Set (abstract data type); Branch and cut; Truck; Constraint programming; Computer science; Integer (computer science); Branch and price; Facility location problem; Constraint (computer-aided design); Mathematics; Stochastic programming; Engineering","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.001572196,0.001568156,0.0009044144,0.001192331,0.0007219789,0.001558344,0.001022023,0.001176791,0.006238503],"category_scores_gemma":[0.003049853,0.000916401,0.00151284,0.001279972,0.001062837,0.001541106,0.001010472,0.00177058,0.000796232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001410248,"about_ca_system_score_gemma":0.002363136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005051496,"about_ca_topic_score_gemma":0.006408298,"domain_scores_codex":[0.9992037,0.0003425301,0.00003061678,0.000102943,0.0002090139,0.0001111822],"domain_scores_gemma":[0.9987941,0.0008709326,0.0001092638,0.0000690634,0.0001216747,0.00003496487],"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.00007353827,0.00008967262,0.0002650648,0.0001169691,0.00004168566,0.00008049839,0.00005589281,0.9246897,0.002695319,0.03180425,0.001275917,0.0388116],"study_design_scores_gemma":[0.00003138973,0.00004467448,0.0000368227,0.00001485716,0.00001597151,0.00002151213,0.00002871562,0.9779279,0.001306924,0.0194768,0.001085905,0.000008506691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008797229,0.0000652928,0.986384,0.0001871007,0.00002568066,0.0001079571,0.00009576383,0.0002654974,0.004071556],"genre_scores_gemma":[0.1339061,0.0002359173,0.8616863,0.0002205632,0.00003777014,0.0003508195,0.0003659774,0.0001294085,0.003067227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006238503,"threshold_uncertainty_score":0.02086985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06676374751484022,"score_gpt":0.2834394180488443,"score_spread":0.2166756705340041,"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."}}