{"id":"W2022879582","doi":"10.1016/j.cie.2012.07.006","title":"Relax-and-fix decomposition technique for solving large scale grid-based location problems","year":2012,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Decomposition; Mathematical optimization; Grid; Integer programming; Benders' decomposition; Computer science; Branch and bound; Scale (ratio); Linear programming; Branch and cut; Tree (set theory); 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008536304,0.0002261084,0.0002295298,0.0002100095,0.0001058814,0.00006667077,0.0001223814,0.0002654376,0.000003482502],"category_scores_gemma":[0.0000977568,0.0002734733,0.00005929595,0.000337853,0.00001193676,0.0003058331,0.00003929252,0.0003038657,0.000002275273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001795618,"about_ca_system_score_gemma":0.00002134744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002656484,"about_ca_topic_score_gemma":3.489508e-7,"domain_scores_codex":[0.9988378,0.00002835706,0.0003421007,0.0001900189,0.0001198497,0.0004818485],"domain_scores_gemma":[0.9993151,0.0002320593,0.00005631521,0.0001832941,0.00006150892,0.0001516772],"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.000005736178,0.00001980154,0.0004125798,0.0001338064,0.00002034901,1.857224e-7,0.0001612481,0.9831172,0.01315835,0.0001643614,0.0002790978,0.002527285],"study_design_scores_gemma":[0.0009239784,0.0000318373,0.0002177758,0.0002682987,0.00002677199,0.000007958889,0.000009334677,0.9720364,0.02340134,0.000006013516,0.002771559,0.0002987464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01242351,0.0001878135,0.9839427,0.00004647943,0.001758098,0.0008068024,0.000009881042,0.0008009631,0.00002378878],"genre_scores_gemma":[0.64332,0.000004704254,0.3553043,0.00002276273,0.001018974,0.0001862578,0.00005828469,0.00008112209,0.000003553308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6308965,"threshold_uncertainty_score":0.9999717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02363982486011327,"score_gpt":0.25562696010428,"score_spread":0.2319871352441667,"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."}}