Solving LP relaxations of large-scale precedence constrained problems

Authors:
Daniel Bienstock;Mark Zuckerberg
Affiliations:
APAM and IEOR Depts., Columbia University;Resource and Business Optimization Group Function, BHP Billiton Ltd.
Venue:
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Year:
2010

Citing 5
Cited 3

An Application of Branch and Cut to Open Pit Mine Scheduling

Journal of Global Optimization
LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity

Computers and Operations Research
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Operations Research
A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem

Operations Research
A New Algorithm for the Open-Pit Mine Production Scheduling Problem

Operations Research

A Review of Operations Research in Mine Planning

Interfaces
A New Algorithm for the Open-Pit Mine Production Scheduling Problem

Operations Research
Content placement via the exponential potential function method

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe new algorithms for solving linear programming relaxations of very large precedence constrained production scheduling problems. We present theory that motivates a new set of algorithmic ideas that can be employed on a wide range of problems; on data sets arising in the mining industry our algorithms prove effective on problems with many millions of variables and constraints, obtaining provably optimal solutions in a few minutes of computation.