{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008031879,0.0001521928,0.0001400371,0.0001421747,0.0003639559,0.0001402603,0.0001299168,0.00005811494,0.000007567314],"category_scores_gemma":[0.00005330741,0.0001110418,0.0000375515,0.0002331795,0.0000412168,0.0001891744,0.00002048872,0.0003391715,0.000002939776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001484256,"about_ca_system_score_gemma":0.00003465278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008207579,"about_ca_topic_score_gemma":0.000003682422,"domain_scores_codex":[0.9990308,0.00003262822,0.0003998252,0.00009901601,0.0001774559,0.0002602356],"domain_scores_gemma":[0.9993982,0.0001268514,0.0001480364,0.0001060604,0.0001053614,0.0001154835],"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.00001891976,0.000008982096,0.0005076252,0.00002800906,0.0000216338,0.000003529702,0.001938967,0.983667,0.0003376247,0.001645736,0.00001549615,0.01180645],"study_design_scores_gemma":[0.0003399639,0.00007622423,0.001587646,0.0002628824,0.00001405608,0.0001714585,0.0002689071,0.9949323,0.001534845,0.0005774635,0.00005936419,0.0001749114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813247,0.00001499767,0.8171858,0.00006834786,0.000197434,0.0001513437,0.000002332745,0.00009634475,0.0009587046],"genre_scores_gemma":[0.6329011,0.000001783251,0.3667774,0.000241835,0.00006182791,8.425804e-7,0.00000188302,0.00001289022,4.607386e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4515765,"threshold_uncertainty_score":0.4528154,"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."}}