Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2104.03440
Cited By

Heuristic Strategies for Solving Complex Interacting Large-Scale
Stockpile Blending Problems

Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems

IEEE Congress on Evolutionary Computation (CEC), 2021

8 April 2021

ArXiv (abs)PDF HTML

Papers citing "Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems"

3 / 3 papers shown

Bi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling Problem under Uncertainty with Chance Constraints

Bi-Objective Evolutionary Optimization for Large-Scale Open Pit Mine Scheduling Problem under Uncertainty with Chance Constraints

Ishara Hewa Pathiranage

72

0

0

11 Nov 2025

Improving Confidence in Evolutionary Mine Scheduling via Uncertainty
Discounting

Improving Confidence in Evolutionary Mine Scheduling via Uncertainty DiscountingIEEE Congress on Evolutionary Computation (CEC), 2023

Michael Stimson

Simon Ratcliffe

173

5

0

29 May 2023

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple
Reclaimers

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple ReclaimersACM Symposium on Applied Computing (SAC), 2021

64

4

0

23 Dec 2021

Page 1 of 1