{"id":"W1998766420","doi":"10.1117/12.568640","title":"Linear programming as an optimization tool in survivable optical networks","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Routing and wavelength assignment; Computer science; Integer programming; Routing (electronic design automation); Linear programming; Wavelength-division multiplexing; Computer network; Survivability; Assignment problem; Mathematical optimization; Distributed computing; Path (computing); Wavelength; Algorithm; Mathematics","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.00404059,0.002153984,0.001337156,0.001486027,0.000696944,0.003036503,0.001574329,0.001793037,0.003987529],"category_scores_gemma":[0.005954757,0.0009570253,0.001273816,0.004080466,0.002832812,0.002567254,0.002067885,0.005158395,0.001194634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002031266,"about_ca_system_score_gemma":0.002155311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004058698,"about_ca_topic_score_gemma":0.003438264,"domain_scores_codex":[0.9963899,0.002494808,0.00009230614,0.0002108802,0.0006498268,0.0001621951],"domain_scores_gemma":[0.9962578,0.003101576,0.0002227152,0.00009346576,0.0002501491,0.00007435129],"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.00004274265,0.0001281335,0.0002115718,0.0003869918,0.00007170134,0.0001188235,0.0001634864,0.4520201,0.0004249616,0.4846437,0.009910434,0.05187725],"study_design_scores_gemma":[0.00002041983,0.00004956852,0.00005490991,0.0001256892,0.00001509514,0.0000252678,0.00005896998,0.6677615,0.0002455445,0.3174074,0.01421329,0.00002217812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001645714,0.004699188,0.9734355,0.002107472,0.0002661484,0.00006432665,0.0001086098,0.0001723777,0.01750062],"genre_scores_gemma":[0.1520476,0.01840718,0.8056317,0.001809272,0.001823476,0.001184115,0.000360051,0.0004137365,0.01832277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004058698,"threshold_uncertainty_score":0.02136892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008911643802335107,"score_gpt":0.2264761610301753,"score_spread":0.2175645172278402,"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."}}