{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001166113,0.00009992334,0.00008463649,0.00001527481,0.0001236755,0.00001881091,0.00009395515,0.00009335461,0.000006534472],"category_scores_gemma":[0.00001202093,0.00007328072,0.00002417389,0.00007870373,0.000044829,0.00007380623,0.0000326409,0.000158251,0.000001642605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003108804,"about_ca_system_score_gemma":0.000001394855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001641217,"about_ca_topic_score_gemma":0.000009029701,"domain_scores_codex":[0.9994703,0.000006537178,0.000132781,0.0001120563,0.00004960307,0.0002287329],"domain_scores_gemma":[0.99961,0.0001878205,0.00002829053,0.0001306859,0.00001726257,0.00002592368],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002022704,0.00001710443,0.0005838705,0.00002518292,0.00007099937,0.000001181558,0.0003201806,0.312975,0.00006213449,0.03106901,0.001027966,0.6538272],"study_design_scores_gemma":[0.0001884667,0.00004421705,0.001838165,0.00002977427,0.0000260366,0.00000280585,0.00009164333,0.9896891,0.0001050271,0.006837379,0.001024709,0.0001227454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00555135,0.0008785466,0.9900638,0.00007456374,0.000162487,0.0004308462,0.000001222043,0.000541997,0.002295221],"genre_scores_gemma":[0.9080732,0.0003033998,0.09132676,0.00003101491,0.0001132269,0.0001116923,0.000004172846,0.00002246952,0.0000140309],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9025219,"threshold_uncertainty_score":0.2988301,"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."}}