{"id":"W2101968000","doi":"10.1109/hpsr.2003.1226675","title":"A Lagrangean relaxation approach to the maximizing-number-of-connection problem in WDM networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Subgradient method; Routing and wavelength assignment; Wavelength-division multiplexing; Computer science; Mathematical optimization; Heuristic; Lagrangian relaxation; Computational complexity theory; Relaxation (psychology); Routing (electronic design automation); Lagrange multiplier; Resource allocation; Network topology; Mathematics; Algorithm; Wavelength; Computer network","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.00253781,0.001117617,0.0009523064,0.0005327368,0.0006128285,0.0009041852,0.001065729,0.001332064,0.002267092],"category_scores_gemma":[0.003026753,0.0006973303,0.0006987855,0.001105054,0.001119118,0.001368254,0.0009713484,0.002244405,0.0003803054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035661,"about_ca_system_score_gemma":0.001828964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00426087,"about_ca_topic_score_gemma":0.003617354,"domain_scores_codex":[0.9990317,0.0006603551,0.0000225744,0.00007396779,0.0001427955,0.00006857598],"domain_scores_gemma":[0.9990884,0.0007100489,0.00006949172,0.00002749424,0.00007308607,0.00003153788],"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.0000430221,0.00005262257,0.0001486463,0.0001735686,0.00002534209,0.00007979099,0.00007732221,0.9135739,0.0008517364,0.06138114,0.002201131,0.02139171],"study_design_scores_gemma":[0.00002070566,0.00003146874,0.00005829596,0.00001559235,0.000005543809,0.00002202673,0.00001563908,0.9726726,0.0002802073,0.024638,0.002232811,0.000006976224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004880785,0.0008634519,0.9893735,0.0005204051,0.00005637198,0.0000545077,0.00004711462,0.00004093927,0.004162894],"genre_scores_gemma":[0.2610399,0.003020284,0.7264771,0.0003162479,0.0003685268,0.0005249554,0.0001925311,0.0001345186,0.007925914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00426087,"threshold_uncertainty_score":0.01342142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01026947818981835,"score_gpt":0.2131906748527025,"score_spread":0.2029211966628841,"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."}}