Pages that link to "Item:Q3569804"
From MaRDI portal
The following pages link to Solving LP Relaxations of Large-Scale Precedence Constrained Problems (Q3569804):
Displaying 31 items.
- On the directed cut cone and polytope (Q281821) (← links)
- An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
- Aggregation heuristic for the open-pit block scheduling problem (Q321137) (← links)
- Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty (Q322445) (← links)
- Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty (Q323260) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs (Q480938) (← links)
- Tailored Lagrangian relaxation for the open pit block sequencing problem (Q490234) (← links)
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- A sliding time window heuristic for open pit mine block sequencing (Q691428) (← links)
- Linear programming based algorithms for preemptive and non-preemptive RCPSP (Q884023) (← links)
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines (Q887202) (← links)
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (Q1744895) (← links)
- A local branching heuristic for the open pit mine production scheduling problem (Q1752798) (← links)
- Optimizing the open pit-to-underground mining transition (Q1752806) (← links)
- Linear models for stockpiling in open-pit mine production scheduling problems (Q1753425) (← links)
- Underground mine scheduling under uncertainty (Q2031110) (← links)
- Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse (Q2097658) (← links)
- Short- and medium-term optimization of underground mine planning using constraint programming (Q2112619) (← links)
- A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem (Q2160495) (← links)
- Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
- Hyper-heuristic approaches for strategic mine planning under uncertainty (Q2289889) (← links)
- Constructing branching trees of geostatistical simulations (Q2676486) (← links)
- Hierarchical benders decomposition for open-pit mine block sequencing (Q2830758) (← links)
- Large-scale multi-period precedence constrained knapsack problem: a mining application (Q2883587) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
- Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach (Q5144773) (← links)
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5501230) (← links)
- A real-world mine excavators timetabling methodology in open-pit mining (Q6050355) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
