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

DOI10.1016/j.endm.2010.05.052zbMath1237.90279DBLPjournals/endm/MorenoEG10OpenAlexW1996886399WikidataQ57707481 ScholiaQ57707481MaRDI QIDQ2883587

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

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

Related Items (11)

Concurrent open-pit mine production and in-pit crushing–conveying system planning ⋮ 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 ⋮ 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 ⋮ Tailored Lagrangian relaxation for the open pit block sequencing problem ⋮ A local branching heuristic for the open pit mine production scheduling problem ⋮ Comparative analysis of three metaheuristics for short-term open pit block sequencing ⋮ Hyper-heuristic approaches for strategic mine planning under uncertainty ⋮ Approximation schemes for multiperiod binary knapsack problems

Cites Work

• Lifting cover inequalities for the precedence-constrained knapsack problem
• Polyhedral results for the precedence-constrained knapsack problem
• An application of branch and cut to open pit mine scheduling
• Heuristic and exact algorithms for the precedence-constrained knapsack problem
• Lifting valid inequalities for the precedence constrained knapsack problem
• 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
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• Approximation Algorithms for Certain Scheduling Problems

This page was built for publication: Large-scale multi-period precedence constrained knapsack problem: A mining application