Large-scale multi-period precedence constrained knapsack problem: a mining application
DOI10.1016/J.ENDM.2010.05.052zbMATH Open1237.90279DBLPjournals/endm/MorenoEG10OpenAlexW1996886399WikidataQ57707481 ScholiaQ57707481MaRDI QIDQ2883587FDOQ2883587
Authors: Eduardo Moreno, Marcos Goycoolea, Daniel G. Espinoza 
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.052
Recommendations
- A new algorithm for the open-pit mine production scheduling problem
- Solving LP relaxations of large-scale precedence constrained problems
- A pegging approach to the precedence-constrained knapsack problem
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)
Cites Work
- A survey of effective heuristics and their application to a variety of knapsack problems
- An application of branch and cut to open pit mine scheduling
- Solving LP relaxations of large-scale precedence constrained problems
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Polyhedral results for the precedence-constrained knapsack problem
- Lifting valid inequalities for the precedence constrained knapsack problem
- Approximation Algorithms for Certain Scheduling Problems
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
Cited In (14)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- Hyper-heuristic approaches for strategic mine planning under uncertainty
- Solving LP relaxations of large-scale precedence constrained problems
- Tailored Lagrangian relaxation for the open pit block sequencing problem
- A new algorithm for the open-pit mine production scheduling problem
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- Exploiting packing components in general-purpose integer programming solvers
- Approximation schemes for multiperiod binary knapsack problems
- A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
- Concurrent open-pit mine production and in-pit crushing–conveying system planning
- A local branching heuristic for the open pit mine production scheduling problem
- 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
- Comparative analysis of three metaheuristics for short-term open pit block sequencing
This page was built for publication: Large-scale multi-period precedence constrained knapsack problem: a mining application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883587)
