{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552747,0.00109831,0.001283491,0.0006473949,0.0004989271,0.0006200924,0.001319309,0.0009113025,0.004577137],"category_scores_gemma":[0.003259581,0.0006885218,0.001263118,0.0008531465,0.0007364574,0.0009422021,0.001844087,0.002270544,0.0007814502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004851692,"about_ca_system_score_gemma":0.001146055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005478674,"about_ca_topic_score_gemma":0.006019746,"domain_scores_codex":[0.9995709,0.0002141215,0.00001604907,0.00004849343,0.00009498293,0.00005546116],"domain_scores_gemma":[0.9990861,0.0005833035,0.00006398449,0.0001041699,0.0001141205,0.00004834555],"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.0001368739,0.00007551469,0.0004916106,0.0001859997,0.00008934692,0.0001055563,0.0000722019,0.9062042,0.002081168,0.03239509,0.006031024,0.05213142],"study_design_scores_gemma":[0.00002176195,0.0000187414,0.0000456236,0.000006760409,0.000008506693,0.00001309994,0.00001441147,0.9905743,0.0002266841,0.008065171,0.001001428,0.000003568082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003823886,0.0001302706,0.9936637,0.0001247411,0.00004695829,0.00003636637,0.00008240557,0.00013748,0.001954299],"genre_scores_gemma":[0.173721,0.0003595735,0.8213732,0.0001819611,0.00007625972,0.0004539457,0.0003387096,0.0002561676,0.003239196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005478674,"threshold_uncertainty_score":0.01531202,"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."}}