A local branching heuristic for the open pit mine production scheduling problem (Q1752798): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Daryl L. Essam / rank
 
Normal rank
Property / author
 
Property / author: Ruhul A. Sarker / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MineLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.07.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2471320409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization using special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving LP Relaxations of Large-Scale Precedence Constrained Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of branch and cut to open pit mine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the Open-Pit Mine Production Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sliding time window heuristic for open pit mine block sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: MineLib: a library of open pit mining problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation heuristic for the open-pit block scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tailored Lagrangian relaxation for the open pit block sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3103879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale multi-period precedence constrained knapsack problem: A mining application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The new Fundamental Tree Algorithm for production scheduling of open pit mines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local branching heuristic for the capacitated fixed-charge network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long term production planning of open pit mines by ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical programming viewpoint for solving the ultimate pit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem / rank
 
Normal rank

Latest revision as of 16:28, 15 July 2024

scientific article
Language Label Description Also known as
English
A local branching heuristic for the open pit mine production scheduling problem
scientific article

    Statements

    A local branching heuristic for the open pit mine production scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    open pit mine production scheduling
    0 references
    minimum resource requirements
    0 references
    local branching
    0 references
    heuristics
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references