{"id":"W2076901012","doi":"10.1007/s00453-011-9596-0","title":"Two-stage Robust Network Design with Exponential Scenarios","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Theory of computation; Facility location problem; Integer programming; Mathematical optimization; Computer science; Combinatorial optimization; Tree (set theory); Combinatorics; Integer (computer science); Network planning and design; Mathematics; Approximation algorithm; Stage (stratigraphy); Discrete mathematics; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004318668,0.0003009062,0.0002792673,0.0001207629,0.0003800391,0.0001738241,0.001538399,0.00007925877,0.0002212251],"category_scores_gemma":[0.00001097254,0.000259594,0.0001054807,0.0007702032,0.0001882012,0.0006027101,0.0004153462,0.0003079543,0.0001303131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000331678,"about_ca_system_score_gemma":0.0001133759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002020906,"about_ca_topic_score_gemma":0.00002880683,"domain_scores_codex":[0.997703,0.000159323,0.0002943541,0.0006837437,0.0004181355,0.0007414226],"domain_scores_gemma":[0.9984484,0.0001077659,0.0001346759,0.0009827453,0.0001056831,0.0002207102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004171972,0.001479839,0.0007134184,0.00005983825,0.0006740163,0.002863241,0.006978485,0.05553733,0.000305357,0.5787063,0.01228598,0.339979],"study_design_scores_gemma":[0.00255754,0.001062632,0.001490947,0.000113358,0.00005926619,0.0002784645,0.0001281614,0.9500949,0.004072769,0.03107351,0.007598982,0.00146949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006497975,0.0001114155,0.9937751,0.0001178427,0.0006790951,0.0003167135,0.000003759937,0.00043258,0.003913736],"genre_scores_gemma":[0.04843974,0.000009593797,0.9502994,0.0003211259,0.0004003939,0.00004200617,0.000003882089,0.00002849825,0.0004553267],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8945575,"threshold_uncertainty_score":0.9999856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06642916085159743,"score_gpt":0.2295919852726201,"score_spread":0.1631628244210227,"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."}}