{"id":"W1606362855","doi":"10.1023/a:1011280023547","title":"Capacity and flow assignment of data networks by generalized Benders decomposition","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Decomposition; Mathematical optimization; Flow network; Network topology; Benders' decomposition; Multi-commodity flow problem; Decomposition method (queueing theory); Flow (mathematics); Integer (computer science); Regular polygon; Measure (data warehouse); Function (biology); Integer programming; Quality of service; Computer science; Discrete mathematics; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001844582,0.001274014,0.001447924,0.001474818,0.0006990123,0.001670601,0.001453609,0.0009783664,0.004941447],"category_scores_gemma":[0.004568692,0.001010636,0.001065656,0.002203109,0.001362132,0.002378438,0.001317137,0.001756776,0.0005484398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001582753,"about_ca_system_score_gemma":0.001587809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006455468,"about_ca_topic_score_gemma":0.004418452,"domain_scores_codex":[0.999166,0.0004244659,0.00002589999,0.0001022757,0.0001415195,0.0001399733],"domain_scores_gemma":[0.9988123,0.0006870168,0.0001157475,0.0001124883,0.000179319,0.00009318676],"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.0001189833,0.00005071826,0.0001560867,0.00005494741,0.00002832037,0.00001737954,0.00005678475,0.9298301,0.0009564605,0.04522025,0.001822401,0.02168768],"study_design_scores_gemma":[0.00001660606,0.00001445866,0.00005762158,0.000007498485,0.00000812884,0.000006284613,0.00001423981,0.9334906,0.0002972075,0.06549918,0.0005813906,0.000006829239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03021841,0.0003533578,0.9625965,0.0003318315,0.00005924629,0.0000907646,0.0003154529,0.0002571138,0.005777297],"genre_scores_gemma":[0.5173706,0.0009047699,0.4713646,0.0001962701,0.0001556942,0.0003996822,0.0006700756,0.000357862,0.008580433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006455468,"threshold_uncertainty_score":0.01653075,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01915627088536034,"score_gpt":0.2574983124426431,"score_spread":0.2383420415572828,"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."}}