{"id":"W2065163895","doi":"10.1016/s0166-218x(03)00462-1","title":"Interval data minmax regret network optimization problems","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":134,"is_retracted":false,"has_abstract":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematics; Regret; Interval (graph theory); Minimax; Logarithm; Shortest path problem; Combinatorics; Minimum spanning tree; Path (computing); Function (biology); Bounded function; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Statistics; Computer science","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.003199892,0.001315537,0.001618295,0.0007511961,0.0004223013,0.001757477,0.002224383,0.002182015,0.006151633],"category_scores_gemma":[0.009611626,0.0005102878,0.0006809975,0.001541546,0.0007502346,0.00290165,0.001590687,0.002212945,0.0005881905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00142989,"about_ca_system_score_gemma":0.000540811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00130113,"about_ca_topic_score_gemma":0.00124581,"domain_scores_codex":[0.9990159,0.00044185,0.00004493865,0.0002127067,0.0001977725,0.00008674518],"domain_scores_gemma":[0.995652,0.003295481,0.0003614021,0.0002281531,0.0003324481,0.0001304594],"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.0002287918,0.00008088442,0.0004785176,0.0001359913,0.00006485142,0.00007208933,0.00004516121,0.8792777,0.0005632203,0.0633383,0.0047084,0.05100611],"study_design_scores_gemma":[0.00001427852,0.00003963031,0.0001117253,0.00001406759,0.00001566407,0.00002643737,0.00001163154,0.9586813,0.0003826505,0.03985645,0.0008399838,0.000006189134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0276606,0.000954563,0.9608176,0.0008752898,0.0001234651,0.00006335528,0.00053182,0.000243912,0.008729428],"genre_scores_gemma":[0.7038784,0.001821066,0.2718742,0.0004702918,0.0004289997,0.0004401434,0.001213419,0.0003561648,0.01951727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006151633,"threshold_uncertainty_score":0.02057928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1263009194520116,"score_gpt":0.3558418059577799,"score_spread":0.2295408865057684,"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."}}