{"id":"W90079504","doi":"10.1080/03155986.2005.11732719","title":"Modeling and Analysis of Multicommodity Network Flows Via Goal Programming","year":2005,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Multi-commodity flow problem; Flow network; Mathematical optimization; Linear programming; Lagrangian relaxation; Minimum-cost flow problem; Robustness (evolution); Computer science; Relaxation (psychology); Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142385,0.00008496988,0.000196827,0.0003366079,0.0001842094,0.0002947795,0.00006277962,0.00007349811,0.00001647033],"category_scores_gemma":[0.00009207543,0.00007482275,0.0000326075,0.0005240914,0.00004002111,0.001141869,0.00004529043,0.000143792,0.00000938794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003890599,"about_ca_system_score_gemma":0.00002137353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006223232,"about_ca_topic_score_gemma":0.00003405348,"domain_scores_codex":[0.9987175,0.00002883641,0.0005527348,0.00006285326,0.0004275311,0.0002104726],"domain_scores_gemma":[0.9992539,0.0001135271,0.00002935095,0.00009728887,0.0004057616,0.0001002133],"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.000004661505,0.000006047713,0.0001467972,0.0001316362,0.00009089313,4.450856e-8,0.0008745032,0.9583611,0.000008943419,0.008338906,0.00004030955,0.03199613],"study_design_scores_gemma":[0.0001787644,0.00001415838,0.0001299857,0.00002641267,0.00002183137,0.00000212278,0.0002853468,0.9918094,0.000006915655,0.00001537536,0.007432103,0.00007755165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1275988,0.0004137632,0.8680573,0.00008329534,0.00008129645,0.0007888806,0.00002422097,0.0001094602,0.002843032],"genre_scores_gemma":[0.9789596,0.00005119241,0.02072595,0.00001679642,0.00006123436,0.00006449912,0.00009636277,0.000005545863,0.00001887164],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8513607,"threshold_uncertainty_score":0.3051183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03883840468365876,"score_gpt":0.3158162269583731,"score_spread":0.2769778222747143,"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."}}