{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206532,0.0001008019,0.0001552595,0.00002442182,0.0002570841,0.0001524617,0.0004291058,0.00007273657,0.00002796872],"category_scores_gemma":[0.0002898635,0.00007212214,0.0001858214,0.0002051452,0.00006445614,0.0001698505,0.00006986004,0.000932226,0.000004985605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466607,"about_ca_system_score_gemma":0.0001897155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003855193,"about_ca_topic_score_gemma":4.602207e-7,"domain_scores_codex":[0.998745,0.00006796487,0.0002955945,0.0001110717,0.0005319882,0.0002483345],"domain_scores_gemma":[0.9993384,0.0001487734,0.00005603145,0.0001322536,0.0002306807,0.00009384527],"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.00005033074,0.00005767193,0.0005284393,0.0001028199,0.00008099781,0.000005166026,0.002920474,0.9503482,0.0007140109,0.0006525115,0.04383579,0.0007035692],"study_design_scores_gemma":[0.0003073857,0.0001454445,0.000459369,0.00007236275,0.00000629742,0.00001120375,0.0005112559,0.989176,0.0001292837,0.0001379935,0.008957425,0.00008598075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5190575,0.0008056749,0.4490958,0.02032845,0.0005738194,0.001338577,0.00007039784,0.0002438822,0.008485954],"genre_scores_gemma":[0.9094573,0.00003044803,0.08952449,0.0006486569,0.0002247428,0.00001248436,0.000005679351,0.00002717165,0.00006908878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3903998,"threshold_uncertainty_score":0.405011,"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."}}