{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002183395,0.001359833,0.0007642083,0.000664334,0.0006840631,0.0009005033,0.0008672121,0.0009632375,0.002585197],"category_scores_gemma":[0.00215351,0.0005886312,0.0008590639,0.001076245,0.000913126,0.001310237,0.001045217,0.001875503,0.0005767528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001309783,"about_ca_system_score_gemma":0.001717418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003139728,"about_ca_topic_score_gemma":0.00385989,"domain_scores_codex":[0.9992429,0.0004206505,0.00001908817,0.00006672172,0.0001891346,0.0000615801],"domain_scores_gemma":[0.9994342,0.0003986651,0.00005217261,0.00002885031,0.00006116326,0.00002500623],"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.00003256337,0.00005675196,0.0001488086,0.0001637364,0.00002961914,0.00007524933,0.00008745791,0.7804706,0.001554304,0.173316,0.002690428,0.04137454],"study_design_scores_gemma":[0.00001252624,0.00002281371,0.00004721592,0.00002138709,0.000006475064,0.00001949706,0.00001536568,0.9348781,0.0003600151,0.060513,0.004096221,0.000007348568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00208122,0.0005253909,0.9945005,0.0002569726,0.00004279643,0.00003072456,0.00003462341,0.00002697722,0.002500729],"genre_scores_gemma":[0.1225409,0.002286337,0.8671984,0.0002242705,0.000227967,0.0004314951,0.0001453032,0.0000946835,0.006850538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003139728,"threshold_uncertainty_score":0.01154703,"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."}}