{"id":"W3001004579","doi":"10.1080/01605682.2019.1700179","title":"Sublevel stope layout planning through a greedy heuristic approach based on dynamic programming","year":2020,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Heuristics; Computer science; Benchmark (surveying); Heuristic; Greedy algorithm; Limit (mathematics); Set (abstract data type); Plan (archaeology); Algorithm; 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.0004704985,0.001068854,0.001276291,0.0009512084,0.0005508022,0.001045452,0.001078455,0.0008362549,0.003911216],"category_scores_gemma":[0.0009643615,0.0007652649,0.0009447892,0.001063555,0.0006436948,0.0008534843,0.0009019098,0.0009880037,0.0004072215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001045984,"about_ca_system_score_gemma":0.002304659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007149372,"about_ca_topic_score_gemma":0.01047025,"domain_scores_codex":[0.999586,0.00009635575,0.00001554849,0.00008709086,0.0001170827,0.00009788247],"domain_scores_gemma":[0.9995146,0.0002987598,0.00004739688,0.00004143569,0.00006266264,0.00003512914],"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.00003499943,0.00004821816,0.0002348829,0.00008598646,0.00002576857,0.00007612429,0.00004080796,0.9382499,0.001717802,0.007656786,0.001603361,0.05022528],"study_design_scores_gemma":[0.000008563195,0.0000256735,0.0000508094,0.00000548413,0.000006838825,0.00002115306,0.00001812209,0.9952394,0.0004414679,0.003244723,0.0009322239,0.000005492436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01505664,0.0002965494,0.9788737,0.0001450574,0.00003818255,0.000121734,0.00009264325,0.0005864823,0.004788928],"genre_scores_gemma":[0.2956413,0.0003731723,0.6991888,0.0001299495,0.00002853582,0.000325057,0.0002834279,0.0002261126,0.00380361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007149372,"threshold_uncertainty_score":0.01421553,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1336255670865557,"score_gpt":0.3543659230622933,"score_spread":0.2207403559757376,"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."}}