{"id":"W2786155106","doi":"10.1016/j.ejor.2018.01.022","title":"Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"European Regional Development Fund; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; European Commission","keywords":"Heuristics; Mathematical optimization; Linear programming; Integer programming; Mathematics; Heuristic; Limit (mathematics); Fixed charge; Scaling; Iterative method; Set (abstract data type); Integer (computer science); Algorithm; Computer science","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.005010693,0.0001200121,0.0001662776,0.0001443832,0.0003971693,0.0002326145,0.0001490429,0.00002743712,0.000072556],"category_scores_gemma":[0.001296439,0.00009808499,0.00004377753,0.0002099157,0.0001453107,0.0001366241,0.00002694695,0.0003529525,0.00002966151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004668917,"about_ca_system_score_gemma":0.00005316998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.525297e-7,"about_ca_topic_score_gemma":1.828207e-7,"domain_scores_codex":[0.9982042,0.0005189882,0.0004129281,0.0001187776,0.0004138197,0.0003312786],"domain_scores_gemma":[0.9976513,0.0008968973,0.00005625547,0.00009515485,0.00113363,0.0001667822],"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.0006275302,0.0003390806,0.00005369267,0.0002507638,0.0001467675,0.00007445057,0.002538799,0.9332905,0.002399453,0.006923743,0.01054419,0.04281096],"study_design_scores_gemma":[0.0007669917,0.000652897,0.00004273642,0.0001855036,0.000008099491,0.000009473472,0.00004877141,0.9909299,0.0009508124,0.000105033,0.006192023,0.0001077379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004792086,0.00005151516,0.9931784,0.0002333868,0.0001472861,0.0004369631,0.000007702317,0.00003596823,0.001116677],"genre_scores_gemma":[0.5242186,0.000009684091,0.4750227,0.0000592818,0.0005754879,0.000007175177,0.00000807886,0.00003912534,0.00005997158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5194265,"threshold_uncertainty_score":0.399979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1243125413768113,"score_gpt":0.3508453785029433,"score_spread":0.226532837126132,"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."}}