{"id":"W1566305412","doi":"","title":"Minimum Cost Flow Problem on Dynamic Multi Generative Network flows","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Minimum-cost flow problem; Flow network; Multi-commodity flow problem; Mathematical optimization; Computer science; Computation; Flow (mathematics); Time horizon; Mathematics; Algorithm","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446611,0.0008425094,0.001009874,0.0009456498,0.0005567346,0.00147573,0.001349657,0.001398417,0.003094688],"category_scores_gemma":[0.003969138,0.0006731696,0.0009083369,0.001381434,0.001294346,0.003183211,0.001043687,0.001240963,0.0002156548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371136,"about_ca_system_score_gemma":0.00122365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003550019,"about_ca_topic_score_gemma":0.002365419,"domain_scores_codex":[0.9990739,0.0003986086,0.00003315758,0.0002122981,0.0001466329,0.0001354646],"domain_scores_gemma":[0.998693,0.0008898341,0.0001370134,0.00009793278,0.0001101651,0.00007204128],"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.00003849352,0.00003120632,0.0002015172,0.00003656985,0.00001046212,0.00007383636,0.00003094917,0.9018918,0.0004179299,0.09059252,0.0005825402,0.006092166],"study_design_scores_gemma":[0.000007811542,0.00001172884,0.00006744314,0.000004242519,0.000004166195,0.00001966381,0.00001381244,0.9606242,0.0002279052,0.03852693,0.000488155,0.000003951424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05349524,0.0001700752,0.9400504,0.0003335718,0.00002452791,0.00006749317,0.0001817376,0.00009026899,0.005586687],"genre_scores_gemma":[0.7942092,0.0004918152,0.1953418,0.0001035008,0.00006836534,0.000251874,0.0005428676,0.0001254488,0.008865089],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003550019,"threshold_uncertainty_score":0.01720387,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04003761077161055,"score_gpt":0.337510223600903,"score_spread":0.2974726128292925,"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."}}