A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- 3 October 2017
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 69 (2) , 501-534
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- CONICYT (ACT 1407, ACT 1407)
- CONICYT (ACT 1407, ACT 1407)
- FONDECYT (1151098, 1151098)
- FONDECYT (1130681, 1150046)
- Conicyt BCH (72130388)
- NSERC RGPIN (5837-08)
- Conicyt-PFCHA/Doctoral (21171357)
This publication has 26 references indexed in Scilit:
- MineLib: a library of open pit mining problemsAnnals of Operations Research, 2012
- A New Algorithm for the Open-Pit Mine Production Scheduling ProblemOperations Research, 2012
- Solving LP Relaxations of Large-Scale Precedence Constrained ProblemsLecture Notes in Computer Science, 2010
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivityComputers & Operations Research, 2009
- Optimisation in Underground Mining2007
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling ProblemOperations Research, 2007
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part IOperations Research, 1973
- Decomposition Principle for Linear ProgramsOperations Research, 1960