{"id":"W4317213942","doi":"10.1016/j.ejor.2023.01.018","title":"Scalable timing-aware network design via lagrangian decomposition","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Process Optimization and Integration","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Computer science; Scalability; Flow network; Heuristic; Schedule; Linear programming; Exploit; Integer programming; Relaxation (psychology); Decomposition; Algorithm; Mathematics","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.003391065,0.00008279832,0.0001000291,0.0003141531,0.0002487767,0.0001908067,0.0002210496,0.00002379796,0.000408289],"category_scores_gemma":[0.0001869416,0.00007338115,0.00004452369,0.0007741124,0.00003327705,0.0004287601,0.00002674966,0.0003586674,0.0006444333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007751516,"about_ca_system_score_gemma":0.00009227652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.3082e-7,"about_ca_topic_score_gemma":7.776132e-7,"domain_scores_codex":[0.9982741,0.0004668561,0.00034493,0.00008581985,0.000576912,0.0002513338],"domain_scores_gemma":[0.9987693,0.0001513039,0.00003633145,0.00008195231,0.0008144709,0.0001465986],"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.00002623201,0.00001097705,0.0000220911,0.00001013614,0.00001969566,0.00004242063,0.0001219592,0.8953061,0.003117011,0.0002852124,0.09730627,0.003731966],"study_design_scores_gemma":[0.0003724746,0.0001933475,0.00123288,0.0001063722,0.000004976856,0.00005810892,0.00006123371,0.9845462,0.002290545,0.0002717451,0.01074665,0.0001154298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003869077,0.0002140063,0.9834332,0.0007366218,0.0003316677,0.0001431108,0.000003368242,0.0001077767,0.01116113],"genre_scores_gemma":[0.9826585,0.0003289786,0.01508223,0.0001023821,0.000788983,0.000004071003,0.00005522595,0.00005169581,0.000927927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9787894,"threshold_uncertainty_score":0.8283101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08843724091774977,"score_gpt":0.3469267175357162,"score_spread":0.2584894766179664,"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."}}