Solving LP Relaxations of Large-Scale Precedence Constrained Problems

DOI10.1007/978-3-642-13036-6_1zbMath1285.90006MaRDI QIDQ3569804

Bienstock, Daniel, Mark Zuckerberg

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_1

Mathematics Subject Classification ID

90C10: Integer programming

90C11: Mixed integer programming

90B35: Deterministic scheduling theory in operations research

Related Items

Exploiting Packing Components in General-Purpose Integer Programming Solvers, Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining, Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach, An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse, A real-world mine excavators timetabling methodology in open-pit mining, On the directed cut cone and polytope, An integrated approach for earthwork allocation, sequencing and routing, Aggregation heuristic for the open-pit block scheduling problem, Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty, Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty, MineLib: a library of open pit mining problems, A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs, Tailored Lagrangian relaxation for the open pit block sequencing problem, The precedence constrained knapsack problem: separating maximally violated inequalities, A sliding time window heuristic for open pit mine block sequencing, A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines, A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling, A local branching heuristic for the open pit mine production scheduling problem, Optimizing the open pit-to-underground mining transition, Linear models for stockpiling in open-pit mine production scheduling problems, Underground mine scheduling under uncertainty, Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse, Short- and medium-term optimization of underground mine planning using constraint programming, 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, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse, Hyper-heuristic approaches for strategic mine planning under uncertainty, Constructing branching trees of geostatistical simulations, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing, Large-scale multi-period precedence constrained knapsack problem: A mining application