পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| লেনের কাট-অফ গ্রেড মডেল× | সিউডোফ্লো অ্যালগরিদম× | |
|---|---|---|
| ক্ষেত্র | খনি প্রকৌশল | খনি প্রকৌশল |
| পরিবার | Process / pipeline | Process / pipeline |
| উদ্ভবের বছর≠ | 1988 | 1992 |
| প্রবর্তক≠ | K. F. Lane | Dorit S. Hochbaum |
| ধরন≠ | Economic optimization framework for ore classification | Efficient algorithm for maximum closure problem |
| মৌলিক উৎস≠ | Lane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗ | Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. link ↗ |
| অপর নাম≠ | Lane Model, Cut-off Grade Optimization, Lane's Optimization Model | Pseudoflow Algorithm, Hochbaum Algorithm |
| সম্পর্কিত | 3 | 3 |
| সারসংক্ষেপ≠ | Lane's Cut-off Grade Model, developed by Kenneth F. Lane and formalized in his 1988 book, provides a rigorous economic framework for determining the minimum grade at which ore should be mined and processed. It accounts for variable mining costs, metallurgical recovery, and commodity prices to optimize profit per unit processed. The model is foundational in mining economics and underpins daily operational decisions at thousands of mines worldwide. | The Pseudoflow Algorithm, developed by Dorit Hochbaum in 1992, is a polynomial-time algorithm for computing maximum weighted closures in directed acyclic graphs. In mining, it solves the ultimate pit limit problem more efficiently than earlier methods. By maintaining feasible pseudoflows and iteratively eliminating negative-cost nodes, it achieves near-optimal practical performance even on industrial-scale block models. |
| ScholarGateডেটাসেট ↗ |
|
|