Solving LP relaxations of large-scale precedence constrained problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6080 LNCS, Issue , 2010, Pages 1-14

  Bienstock, Daniel ^a   Zuckerberg, Mark ^b  

^a Columbia University ^*  (United States)

^b BHP BILLITON   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC IDEAS; CONSTRAINED PROBLEM; DATA SETS; LINEAR PROGRAMMING RELAXATION; LP RELAXATION; MINING INDUSTRY; OPTIMAL SOLUTIONS; PRODUCTION SCHEDULING PROBLEMS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; PRODUCTION ENGINEERING;

INTEGER PROGRAMMING;

EID: 77954420210     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_1     Document Type: Conference Paper

References (16)

1. Balinsky, M.L.: On a selection problem. Management Science 17, 230-231 (1970)
2. Barahona, F., Anbil, R.: The Volume Algorithm: producing primal solutions with a subgradientmethod. Math. Programming 87, 385-399 (2000)
3. Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems, Theory and Practice. Kluwer Academic Publishers, Boston (2002), ISBN 1-4020-7173-6
4. Bienstock, D., Zuckerberg, M.: A new LP algorithm for precedence constrained production scheduling, posted on Optimization Online (August 2009)
5. Boland, N., Dumitrescu, I., Froyland, G., Gleixner, A.M.: LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Computers and Operations Research 36, 1064-1089 (2009)
6. Caccetta, L., Hill, S.P.: An application of branch and cut to open pit mine scheduling. Journal of Global Optimization 27, 349-365 (2003)
7. Chandran, B., Hochbaum, D.: A Computational Study of the Pseud-oflow and Push-Relabel Algorithms for the Maximum Flow Problem. Operations Research 57, 358-376 (2009)
8. Chicoisne, R., Espinoza, D., Goycoolea, M., Morena, E., Rubio, E.: A New Algorithm for the Open-Pit Mine Scheduling Problem (submitted for publication), http://mgoycool.uai.cl/
9. Fricke, C.: Applications of integer programming in open pit mine planning, PhD thesis, Department of Mathematics and Statistics, The University of Melbourne (2006)
10. Hochbaum, D.: The pseudoflow algorithm: a new algorithm for the maximum flow problem. Operations Research 58, 992-1009 (2008)
11. Hochbaum, D., Chen, A.: Improved planning for the open - pit mining problem. Operations Research 48, 894-914 (2000)
12. Johnson, T.B.: Optimum open pit mine production scheduling, PhD thesis, Operations Research Department, University of California, Berkeley (1968)
13. Lerchs, H., Grossman, I.F.: Optimum design of open-pit mines. Transactions C.I.M. 68, 17-24 (1965)
14. Picard, J.C.: Maximal Closure of a graph and applications to combinatorial problems. Management Science 22, 1268-1272 (1976)
15. Rhys, J.M.W.: A selection problem of shared fixed costs and network flows. Management Science 17, 200-207 (1970)
16. Gemcom Software International, Vancouver, BC, Canada