{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000691937,0.001269992,0.001103719,0.0006280791,0.0004628848,0.001134921,0.001220452,0.0007356504,0.003771228],"category_scores_gemma":[0.001901921,0.0007111497,0.0006605356,0.000621108,0.0005411477,0.001013656,0.001212715,0.001152633,0.0005323655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001095655,"about_ca_system_score_gemma":0.00188019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00402856,"about_ca_topic_score_gemma":0.007044631,"domain_scores_codex":[0.9996517,0.00009048452,0.00001072627,0.00005965857,0.0001170803,0.00007040379],"domain_scores_gemma":[0.9993481,0.0003673835,0.00006891342,0.00004887397,0.0001192179,0.00004746547],"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.00002281762,0.00001494917,0.00007782937,0.00003527311,0.00001114857,0.00002183319,0.00001267172,0.9811693,0.002077413,0.005226503,0.0006548557,0.01067544],"study_design_scores_gemma":[0.000004348467,0.000007269815,0.00001245886,0.000002560741,0.000002811276,0.000003670682,0.000003436465,0.9975672,0.0002421127,0.001952673,0.0002001788,0.000001410881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008112421,0.0001930227,0.9867246,0.0001635854,0.00004181673,0.00002880536,0.00005718505,0.0003010391,0.004377646],"genre_scores_gemma":[0.5905361,0.0004468391,0.4031379,0.0001587179,0.00006409094,0.0001890699,0.0002135507,0.0003845241,0.004869274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00402856,"threshold_uncertainty_score":0.01261598,"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."}}