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.
Pierre Nancel-PenardNelson MoralesFabien CornillierPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- knapsack problem
- production planning
- open pit
- optimal solution
- exact algorithms
- heuristic solution
- multidimensional knapsack problem
- randomly generated test instances
- greedy heuristic
- dynamic programming
- linear programming relaxation
- combinatorial optimization problems
- optimization problems
- maximum profit
- mixed integer programming
- np hard
- test problems
- greedy algorithm
- bicriteria
- capacity expansion
- cutting plane
- branch and bound algorithm
- linear programming
- planning horizon
- linear program
- feasible solution
- simulated annealing
- search algorithm
- learning algorithm
- lp relaxation
- tabu search
- network design problem
- multistage
- heuristic methods
- genetic algorithm
- vehicle routing problem
- continuous relaxation