Solving LP relaxations of large-scale precedence constrained problems

DOI10.1007/978-3-642-13036-6_1MaRDI QIDQ3569804zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock, 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

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Mixed integer programming (90C11)

Recommendations

• Large-scale multi-period precedence constrained knapsack problem: a mining application
• A new algorithm for the open-pit mine production scheduling problem
• Strategies for LP-based solving a general class of scheduling problems
• scientific article; zbMATH DE number 3852786
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

Cited in

(31)

• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
• Linear models for stockpiling in open-pit mine production scheduling problems
• 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
• A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
• A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
• Optimizing the open pit-to-underground mining transition
• An integrated approach for earthwork allocation, sequencing and routing
• Large-scale multi-period precedence constrained knapsack problem: a mining application
• Underground mine scheduling under uncertainty
• A sliding time window heuristic for open pit mine block sequencing
• A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
• Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
• Hyper-heuristic approaches for strategic mine planning under uncertainty
• 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
• Tailored Lagrangian relaxation for the open pit block sequencing problem
• Linear programming based algorithms for preemptive and non-preemptive RCPSP
• MineLib: a library of open pit mining problems
• Short- and medium-term optimization of underground mine planning using constraint programming
• Hierarchical benders decomposition for open-pit mine block sequencing
• Constructing branching trees of geostatistical simulations
• Exploiting packing components in general-purpose integer programming solvers
• The precedence constrained knapsack problem: separating maximally violated inequalities
• Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
• A local branching heuristic for the open pit mine production scheduling problem
• A constraint programming approach for the premarshalling problem
• 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
• Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse

This page was built for publication: Solving LP relaxations of large-scale precedence constrained problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569804)