{"id":"W4256141174","doi":"10.1002/net.20362","title":"Lagrangean‐based decomposition algorithms for multicommodity network design problems with penalized constraints","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Mathematical optimization; Decomposition; Flow network; Convergence (economics); Relaxation (psychology); Network planning and design; Context (archaeology); Computer science; Decomposition method (queueing theory); Nonlinear system; Integer (computer science); Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.003143544,0.00144688,0.001391059,0.001242511,0.0006298264,0.001138438,0.001166582,0.00125241,0.003974718],"category_scores_gemma":[0.005043246,0.0009486714,0.0009542602,0.001455888,0.0009496029,0.001243433,0.001692698,0.002332939,0.0008532311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154594,"about_ca_system_score_gemma":0.001768038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006089707,"about_ca_topic_score_gemma":0.005259308,"domain_scores_codex":[0.9989384,0.0006369516,0.00003939617,0.00009710725,0.000192867,0.00009521141],"domain_scores_gemma":[0.997409,0.001912937,0.0001832386,0.0001377381,0.0002746077,0.00008244848],"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.00004269516,0.00004666282,0.0001485435,0.00006091717,0.00002130648,0.00002207897,0.00004123383,0.9459102,0.0004064213,0.01691677,0.001141942,0.03524128],"study_design_scores_gemma":[0.000008564574,0.000006449227,0.0000137443,0.000004979846,0.00000175843,0.000003327746,0.000003892099,0.9953211,0.00009690078,0.00424718,0.0002902199,0.000001892274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004087078,0.0001551194,0.9938604,0.0001132691,0.00001894088,0.00004784144,0.00002745187,0.0001188177,0.001571095],"genre_scores_gemma":[0.1168932,0.0002983299,0.8790806,0.00008582859,0.0000394587,0.0003884356,0.0001928465,0.0001609544,0.002860409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006089707,"threshold_uncertainty_score":0.01662487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04144083009145854,"score_gpt":0.3149675041647392,"score_spread":0.2735266740732806,"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."}}