{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003446168,0.00008428564,0.0001755556,0.00002415643,0.00005462149,0.00007227877,0.0004061345,0.00005663853,0.000009892291],"category_scores_gemma":[0.00001407385,0.00007511213,0.00003345304,0.0002127919,0.00002939813,0.000805995,0.00007621456,0.00007161966,2.040673e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006921168,"about_ca_system_score_gemma":0.00003960953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006537316,"about_ca_topic_score_gemma":0.000003720051,"domain_scores_codex":[0.9990258,0.0000974412,0.0003669001,0.000143049,0.0002482605,0.00011851],"domain_scores_gemma":[0.9991141,0.00003162646,0.0003885447,0.0002103784,0.0001620255,0.00009334158],"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.00004161017,0.00005034938,0.0006815026,0.000001552512,0.00003579086,0.000003681235,0.00001171739,0.9040798,0.00001623508,0.0008412576,0.00384565,0.09039086],"study_design_scores_gemma":[0.0009077435,0.0000999723,0.0002971963,0.00002265131,0.00003155059,0.0001037542,0.000005348152,0.9979064,0.000005161632,0.000144762,0.0004076668,0.00006777129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005488836,0.0007802061,0.9921173,0.001154103,0.0002653328,0.00006509959,0.000008370043,0.00001266005,0.0001080803],"genre_scores_gemma":[0.7369061,0.0007357566,0.2620367,0.0001983391,0.00009852202,4.872562e-7,0.00001602956,0.000002806195,0.000005305678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7314172,"threshold_uncertainty_score":0.3062983,"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."}}