{"id":"W2001887693","doi":"10.1109/icmsao.2013.6552647","title":"Generating maximal efficient faces for the multiobjective multicommodity flow problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Adjacency list; Mathematical optimization; Flow (mathematics); Computer science; Flow network; Space (punctuation); Mathematics; Multi-commodity flow problem; Minimum-cost flow problem; Algorithm","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.00009945136,0.00009281626,0.00008711953,0.00001660095,0.0001394624,0.0001067842,0.00007924005,0.00003349484,0.000171061],"category_scores_gemma":[0.00005393842,0.0000568046,0.00004449022,0.00005409946,0.0000224413,0.00006156886,0.00002133381,0.00006504576,0.00005586784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002260711,"about_ca_system_score_gemma":0.000003453736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001540562,"about_ca_topic_score_gemma":0.00000724671,"domain_scores_codex":[0.9994997,0.000008091361,0.0001457424,0.00009000262,0.00007333458,0.0001830641],"domain_scores_gemma":[0.9995821,0.0001977885,0.00001427316,0.0001008176,0.00006432934,0.00004065807],"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":[5.650559e-7,0.0000223278,0.00000326234,0.00003229463,0.00001663819,2.99444e-8,0.0004521959,0.9555029,0.0005782098,0.0006351861,0.0004431366,0.0423132],"study_design_scores_gemma":[0.0002049849,0.000009648224,0.00002184258,0.000005655067,0.000007597031,4.353169e-7,0.0002732151,0.9974026,0.001378731,0.0001239144,0.0004829242,0.0000884262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01072684,0.00005880062,0.9856155,0.0001438273,0.0001059391,0.001148255,0.000002183616,0.0003335762,0.001865068],"genre_scores_gemma":[0.5342323,0.000001596423,0.4651772,0.00004132881,0.00003528324,0.0003615657,0.000002615714,0.00001514365,0.0001329457],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5235054,"threshold_uncertainty_score":0.2316424,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01414137482039404,"score_gpt":0.2239548519629656,"score_spread":0.2098134771425716,"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."}}