{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00319964,0.000253393,0.0004337426,0.0001254076,0.0002097744,0.0004121029,0.001327036,0.0001396789,0.0005954356],"category_scores_gemma":[0.0009933676,0.0001869705,0.00007228618,0.0009632398,0.00009508234,0.0004209495,0.00029498,0.0001562306,0.0002967624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002269113,"about_ca_system_score_gemma":0.00006936775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002355485,"about_ca_topic_score_gemma":0.00000804141,"domain_scores_codex":[0.9967274,0.00008404874,0.001071194,0.0006543609,0.001068099,0.0003948656],"domain_scores_gemma":[0.9964665,0.0004516414,0.0006020947,0.002178629,0.0001630966,0.0001380156],"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.00001611314,0.0001147074,0.0002538172,0.00002676931,0.00004454772,0.000003019561,0.00160919,0.7447596,0.00003644951,0.1912016,0.05598189,0.005952245],"study_design_scores_gemma":[0.000544378,0.0000398968,0.00002355292,0.00005275408,0.00007677349,0.00002050512,0.001381584,0.7346318,0.0001514561,0.1942725,0.06831574,0.0004891253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008176736,0.0001121724,0.887346,0.0001133727,0.0002865141,0.000545311,0.00003461882,0.00008817044,0.1106561],"genre_scores_gemma":[0.08582672,0.0003384269,0.9103577,0.000223993,0.0001984343,0.00005828382,0.0004298647,0.00007279578,0.002493821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1081623,"threshold_uncertainty_score":0.7624434,"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."}}