{"id":"W2100641445","doi":"10.1002/net.20437","title":"Lagrangean decomposition/relaxation for the routing and wavelength assignment problem","year":2011,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Subgradient method; Mathematical optimization; Relaxation (psychology); Path (computing); Node (physics); Computation; Shortest path problem; Arc routing; Decomposition; Column generation; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Routing (electronic design automation); Algorithm; Combinatorics; Graph; 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.002696915,0.001176841,0.0007594451,0.0007189405,0.0005163683,0.001197886,0.0007359344,0.0009454474,0.004788945],"category_scores_gemma":[0.003567133,0.0005040757,0.0006971104,0.001033024,0.001020237,0.001187818,0.001138724,0.002085316,0.0007619039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001553116,"about_ca_system_score_gemma":0.002177466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004546649,"about_ca_topic_score_gemma":0.003102093,"domain_scores_codex":[0.998841,0.0006612095,0.000031384,0.0001047653,0.0002361485,0.000125509],"domain_scores_gemma":[0.9988559,0.0007820849,0.00009362054,0.00005131719,0.0001673246,0.00004981685],"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.00009400797,0.00009137958,0.0002238889,0.0002155325,0.00003243411,0.00009872944,0.0001040452,0.8344404,0.001376372,0.129265,0.004678095,0.02938008],"study_design_scores_gemma":[0.00001980055,0.00002931658,0.00009023075,0.00002218508,0.000005227863,0.00002926066,0.00002900099,0.958472,0.0003874266,0.03834283,0.002564557,0.000008047579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01193834,0.0006757242,0.9705375,0.0006509156,0.00009729913,0.00009320126,0.0001583543,0.00005341314,0.01579519],"genre_scores_gemma":[0.3481378,0.001771089,0.6322658,0.0003584973,0.0002695659,0.0005479156,0.0004836673,0.0001658263,0.01599987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004788945,"threshold_uncertainty_score":0.0160206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01644478116988058,"score_gpt":0.2204903036944516,"score_spread":0.2040455225245711,"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."}}