{"id":"W2962031742","doi":"10.1016/j.cor.2019.07.007","title":"Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Concordia University; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Solver; Mathematical optimization; Algorithm; Mathematics; Decomposition; Branch and cut; Integer programming; Fixed charge; Linear programming; Integer (computer science); Flow network; Steiner tree problem; Computer science","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.001052838,0.0001608223,0.0001678715,0.0002621523,0.0004544643,0.0002738041,0.0002242735,0.0001051852,0.0001710418],"category_scores_gemma":[0.00003676528,0.0001662377,0.00006383532,0.0004798608,0.00004040477,0.0001846503,0.00002772311,0.0003313224,0.0002356991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001687888,"about_ca_system_score_gemma":0.00006573644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001342692,"about_ca_topic_score_gemma":0.0000083582,"domain_scores_codex":[0.9983853,0.0002777329,0.0002307321,0.0002794033,0.0003138048,0.0005130513],"domain_scores_gemma":[0.9985106,0.0007154928,0.00001084125,0.0003458782,0.0002967178,0.0001204937],"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.00002650508,0.00005821964,0.00003408322,0.00003744636,0.00002481661,7.626964e-7,0.0001446698,0.9821889,0.0005217794,0.0005123696,0.01413559,0.002314811],"study_design_scores_gemma":[0.0008791774,0.0002174647,0.00007918864,0.00007892651,0.000004052873,8.235436e-7,0.00001591561,0.9958215,0.001099084,0.00004719448,0.001571361,0.0001853062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002719912,0.00003361796,0.9938741,0.0003120395,0.000693507,0.001474617,0.0000288933,0.000261911,0.0006013982],"genre_scores_gemma":[0.6912547,0.00001986521,0.3074721,0.0001792226,0.000169156,0.0001875295,0.0004669773,0.00005848347,0.0001919265],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6885348,"threshold_uncertainty_score":0.6778975,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08187649673331249,"score_gpt":0.3443690654403821,"score_spread":0.2624925687070697,"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."}}