{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261007,0.00109661,0.0009606261,0.0008863135,0.000522876,0.001110764,0.001351502,0.0008446975,0.003715091],"category_scores_gemma":[0.003906806,0.000667615,0.00097164,0.0008546094,0.0007681729,0.001154179,0.001129103,0.001550346,0.0004661606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009864216,"about_ca_system_score_gemma":0.001297706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00459762,"about_ca_topic_score_gemma":0.004691799,"domain_scores_codex":[0.9995771,0.0001839038,0.00001564384,0.00004544812,0.0001403189,0.00003755466],"domain_scores_gemma":[0.9987805,0.0007672912,0.00009819931,0.00006560438,0.0002489308,0.0000393371],"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.00002087504,0.00003813823,0.0001643751,0.00005479073,0.00001545336,0.00002338647,0.00004543173,0.9568185,0.00107262,0.02004911,0.0005197343,0.02117752],"study_design_scores_gemma":[0.00000135642,0.000009132649,0.00001267399,0.000002650645,0.000001529926,0.00000290288,0.000002161331,0.9974133,0.00008541225,0.002320715,0.0001464937,0.000001699859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005603657,0.0001295903,0.9897658,0.00008148215,0.00003300303,0.00004243949,0.00001532721,0.0001316373,0.004196987],"genre_scores_gemma":[0.5084659,0.0004552048,0.4844736,0.0001383369,0.00008463531,0.000401941,0.00007667646,0.0002436411,0.005659999],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00459762,"threshold_uncertainty_score":0.01242822,"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."}}