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)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 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 |
scientific article; zbMATH DE number 7567020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
scientific article; zbMATH DE number 7567020 |
Statements
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 (English)
0 references
3 August 2022
0 references
heuristics
0 references
integer programming
0 references
time decomposition
0 references
multidimensional and multiperiod precedence-constrained knapsack problem
0 references
open pit mine scheduling
0 references
0 references
0 references
