Tailored Lagrangian relaxation for the open pit block sequencing problem (Q490234): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-012-1287-y / 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.1007/s10479-012-1287-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969268769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems / 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: A strengthened formulation and cutting planes for the open pit mine production scheduling problem / 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: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / 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 solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine / 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: Production Planning by Mixed Integer Programming / 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 / DOI
 
Property / DOI: 10.1007/S10479-012-1287-Y / rank
 
Normal rank

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Tailored Lagrangian relaxation for the open pit block sequencing problem
scientific article

    Statements

    Tailored Lagrangian relaxation for the open pit block sequencing problem (English)
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    mining
    0 references
    production scheduling
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references

    Identifiers