{"id":"W2004385899","doi":"10.1109/glocom.2002.1189143","title":"A Lagrangean decomposition approach for the routing and wavelength assignment in multifiber WDM networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Routing and wavelength assignment; Linear programming; Wavelength-division multiplexing; Integer programming; Scalability; Computer science; Routing (electronic design automation); Path (computing); Mathematical optimization; Relaxation (psychology); Network topology; Linear programming relaxation; Upper and lower bounds; Multi-commodity flow problem; Topology (electrical circuits); Wavelength; Flow network; Mathematics; Algorithm; Computer network; Physics","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.0001720671,0.0001042445,0.0001017505,0.00002416205,0.00005928649,0.0000223162,0.00006219755,0.00008171038,0.000002937407],"category_scores_gemma":[0.00003292914,0.0000725804,0.00002085285,0.0001098589,0.00003377868,0.00005591179,0.00001855147,0.0001520583,4.217723e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004520834,"about_ca_system_score_gemma":0.000001216468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001823593,"about_ca_topic_score_gemma":0.00001146368,"domain_scores_codex":[0.9994244,0.00001127491,0.0001347394,0.00013248,0.00004630364,0.0002508243],"domain_scores_gemma":[0.9995669,0.0002685794,0.00001151623,0.0001238596,0.00000790879,0.00002119868],"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.00000466551,0.00001630325,0.0003250169,0.00001331776,0.00001582953,5.024568e-7,0.00004925129,0.9027677,0.0001016745,0.01411108,0.00008614815,0.08250847],"study_design_scores_gemma":[0.0002826134,0.00001251935,0.0004245592,0.000008832679,0.000007006258,0.000002538636,0.0002790026,0.9976054,0.0002296351,0.0007012685,0.0003395131,0.0001070514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009107713,0.0004895316,0.9867894,0.00003691802,0.00005148356,0.0004179825,5.48497e-7,0.0002714263,0.002834983],"genre_scores_gemma":[0.774321,0.00009519579,0.2254147,0.00002191963,0.00001687617,0.00009251421,0.000002281614,0.00001532352,0.00002022144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7652133,"threshold_uncertainty_score":0.2959743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01215801962912847,"score_gpt":0.22886900437491,"score_spread":0.2167109847457816,"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."}}