{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074331,0.0001168608,0.0001549823,0.00003073104,0.0006812588,0.00008872948,0.0001095063,0.000134442,0.00004938616],"category_scores_gemma":[0.00001650478,0.0001068595,0.00005056415,0.0002450696,0.0001389712,0.0001334525,0.00000117828,0.0001075121,0.000001733252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003880223,"about_ca_system_score_gemma":0.00009475911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005778702,"about_ca_topic_score_gemma":0.0002799087,"domain_scores_codex":[0.9988428,0.0001723239,0.0001855409,0.0002043228,0.0002026022,0.0003924094],"domain_scores_gemma":[0.9992282,0.000295615,0.0001223711,0.00008948007,0.0001543058,0.0001099639],"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.0001681888,0.00005634655,0.0007007356,0.000003557307,0.00001080312,0.000001852675,0.0006769569,0.9808728,0.000002499155,0.001313377,0.001674914,0.01451793],"study_design_scores_gemma":[0.002718084,0.0003128064,0.005818726,0.0001610665,0.00008193643,9.119431e-7,0.0001538564,0.9852669,0.00001235525,0.001058388,0.004103161,0.0003118064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005713601,0.0000838991,0.9964524,0.0006217675,0.0001532312,0.0009005888,0.00000739277,0.0001978669,0.001011532],"genre_scores_gemma":[0.763656,0.00001984855,0.2350471,0.0005524511,0.0003601618,0.00005355927,0.0002431188,0.00001071977,0.00005708784],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7630846,"threshold_uncertainty_score":0.5239761,"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."}}