{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151356,0.001792444,0.001503821,0.001295712,0.0007497,0.001512551,0.00152268,0.001330849,0.0102266],"category_scores_gemma":[0.003662582,0.001301091,0.001134567,0.001675966,0.0006487191,0.001841468,0.0009617928,0.001870159,0.001119369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001677669,"about_ca_system_score_gemma":0.002661254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007873625,"about_ca_topic_score_gemma":0.009721307,"domain_scores_codex":[0.9993702,0.0002313292,0.00002401376,0.00009194396,0.0001739029,0.0001085804],"domain_scores_gemma":[0.9987281,0.0007816191,0.0001018131,0.0001403435,0.0001898789,0.00005827562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007985369,0.0000798597,0.0001489076,0.00008373695,0.00002680905,0.00001722002,0.00003116736,0.9268679,0.000470198,0.01456859,0.002435447,0.05519033],"study_design_scores_gemma":[0.00001778329,0.00001892076,0.00003414316,0.000009614681,0.000005715534,0.000005472907,0.000008650767,0.9892881,0.000183399,0.009973247,0.0004511983,0.00000383198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009812233,0.0003634085,0.9819329,0.0002120281,0.00008009609,0.0001011957,0.0001255016,0.0005692589,0.006803278],"genre_scores_gemma":[0.2586104,0.0006035953,0.7333596,0.0001769235,0.00009799621,0.0003924756,0.0004539361,0.0003096975,0.005995378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0102266,"threshold_uncertainty_score":0.0342114,"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."}}