Large-scale multi-period precedence constrained knapsack problem: a mining application

DOI10.1016/J.ENDM.2010.05.052MaRDI QIDQ2883587zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

integer programmingopen-pit miningprecedence constrained knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

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

Cites work

• A strengthened formulation and cutting planes for the open pit mine production scheduling problem
• 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
• Approximation Algorithms for Certain Scheduling Problems
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• Lifting cover inequalities for the precedence-constrained knapsack problem
• Lifting valid inequalities for the precedence constrained knapsack problem
• Polyhedral results for the precedence-constrained knapsack problem
• Solving LP relaxations of large-scale precedence constrained problems

Cited in

(14)

• Tailored Lagrangian relaxation for the open pit block sequencing problem
• Solving LP relaxations of large-scale precedence constrained problems
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• A local branching heuristic for the open pit mine production scheduling problem
• Hyper-heuristic approaches for strategic mine planning under uncertainty
• Approximation schemes for multiperiod binary knapsack problems
• 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
• Concurrent open-pit mine production and in-pit crushing–conveying system planning
• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
• A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
• A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
• Exploiting packing components in general-purpose integer programming solvers
• Comparative analysis of three metaheuristics for short-term open pit block sequencing
• A new algorithm for the open-pit mine production scheduling problem

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)