{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:39:33Z","timestamp":1648831173972},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642257063","type":"print"},{"value":"9783642257070","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25707-0_3","type":"book-chapter","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T23:00:23Z","timestamp":1328655623000},"page":"25-39","source":"Crossref","is-referenced-by-count":6,"title":["Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bley","sequence":"first","affiliation":[]},{"given":"Ambros M.","family":"Gleixner","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Vigerske","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,21]]},"reference":[{"key":"3_CR1_3","unstructured":"K. Abhishek, S. Leyffer, and J.T. Linderoth. FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. Technical Report ANL\/MCS-P1374-0906, Argonne National Laboratory, 2006."},{"key":"3_CR2_3","unstructured":"T. Achterberg. Constraint Integer Programming. PhD thesis, TU Berlin, 2007."},{"key":"3_CR3_3","unstructured":"ARKI Consulting & Development A\/S. CONOPT and SBB. \n http:\/\/www.gams.com\/solvers\/solvers.htm\n \n ."},{"issue":"4\u20135","key":"3_CR4_3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"P. Belotti, J. Lee, L. Liberti, F. Margot, and A. W\u00e4chter. Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software, 24(4-5):597\u2013634, 2009","journal-title":"Optimization Methods and Software"},{"key":"3_CR5_3","unstructured":"T. Berthold, S. Heinz, and S. Vigerske. Extending a CIP framework to solve MIQCPs. Technical Report 09-23, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (ZIB), 2009. \n http:\/\/opus.kobv.de\/zib\/volltexte\/2009\/1186\/\n \n ."},{"key":"3_CR6_3","unstructured":"A. Bley, N. Boland, G. Froyland, and M. Zuckerberg. Solving mixed integer nonlinear programming problems for mine production planning with a single stockpile. Technical Report 2009\/21, Institute of Mathematics, TU Berlin, 2009."},{"key":"3_CR7_3","unstructured":"A. Bley, A.M. Gleixner, T. Koch, and S. Vigerske. Comparing MIQCP solvers to a specialised algorithm for mine production scheduling. Technical Report 09-32, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (ZIB), October 2009. \n http:\/\/opus.kobv.de\/zib\/volltexte\/2009\/1206\/\n \n ."},{"key":"3_CR8_3","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.cor.2007.12.006","volume":"36","author":"N Boland","year":"2009","unstructured":"N. Boland, I. Dumitrescu, G. Froyland, and A.M. Gleixner. LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. Comp. & Oper. Research, 36:1064\u20131089, 2009.","journal-title":"Comp. \u0263 Oper. Research"},{"key":"3_CR9_3","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"P. Bonami, L.T. Biegler, A.R. Conn, G. Cornu\u00e9jols, I.E. Grossmann, C.D. Laird, J. Lee, A. Lodi, F. Margot, N. Sawaya, and A. W\u00e4chter. An algorithmic framework for convex mixed integer nonlinear programs. Disc. Opt., 5:186\u2013204, 2008.","journal-title":"Disc. Opt."},{"key":"3_CR10_3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11590-006-0026-1","volume":"1","author":"O Exler","year":"2007","unstructured":"O. Exler and K. Schittkowski. A trust region sqp algorithm for mixed-integer nonlinear programming. Optimization Letters, 1:269\u2013280, 2007.","journal-title":"Optimization Letters"},{"key":"3_CR11_3","unstructured":"J.J. Forrest. CLP and CBC. \n http:\/\/projects.coin-or.org\/{Clp,Cbc}\/\n \n ."},{"key":"3_CR12_3","unstructured":"C. Fricke. Applications of Integer Programming in Open Pit Mining. PhD thesis, University of Melbourne, August 2006."},{"key":"3_CR13_3","volume-title":"Solving large-scale open pit mining production scheduling problems by integer programming","author":"AM Gleixner","year":"2008","unstructured":"A.M. Gleixner. Solving large-scale open pit mining production scheduling problems by integer programming. Master\u2019s thesis, TU Berlin, June 2008."},{"key":"3_CR14_3","unstructured":"IBM. ILOG CPLEX. \n http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex\n \n ."},{"key":"3_CR15_3","unstructured":"B.A. Murtagh and M.A. Saunders. MINOS 5.5 User\u2019s Guide. Department of Operations Research, Stanford University, 1998. Report SOL 83-20R."},{"issue":"2","key":"3_CR16_3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10100-007-0051-x","volume":"16","author":"I Nowak","year":"2008","unstructured":"I. Nowak and S. Vigerske. LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Central Europ. J. of Oper. Research, 16(2):127\u2013138, 2008.","journal-title":"Central Europ. J. of Oper. Research"},{"issue":"1","key":"3_CR17_3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/17480930601118947","volume":"22","author":"MG Osanloo","year":"2008","unstructured":"M.G. Osanloo, J. Gholamnejad, and B. Karimi. Long-term open pit mine production planning: a review of models and algorithms. International Journal of Mining, Reclamation and Environment, 22(1):3\u201335, 2008.","journal-title":"International Journal of Mining, Reclamation and Environment"},{"issue":"2","key":"3_CR18_3","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.ejor.2005.12.035","volume":"177","author":"S Ramazan","year":"2007","unstructured":"S. Ramazan. The new fundamental tree algorithm for production scheduling of open pit mines. European Journal of Oper. Research, 177(2):1153\u20131166, 2007.","journal-title":"European Journal of Oper. Research"},{"key":"3_CR19_3","doi-asserted-by":"crossref","unstructured":"M. Tawarmalani and N.V. Sahinidis. Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4757-3532-1"},{"issue":"1","key":"3_CR20_3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"A. W\u00e4chter and L.T. Biegler. On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming, 106(1):25\u201357, 2006.","journal-title":"Mathematical Programming"}],"container-title":["Modeling, Simulation and Optimization of Complex Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25707-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T12:01:25Z","timestamp":1620043285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25707-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642257063","9783642257070"],"references-count":20,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-25707-0_3","relation":{},"published":{"date-parts":[[2012]]}}}