Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling

  • In this paper we investigate the performance of several out-of-the box solvers for mixed-integer quadratically constrained programmes (MIQCPs) on an open pit mine production scheduling problem with mixing constraints. We compare the solvers BARON, Couenne, SBB, and SCIP to a problem-specific algorithm on two different MIQCP formulations. The computational results presented show that general-purpose solvers with no particular knowledge of problem structure are able to nearly match the performance of a hand-crafted algorithm.

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske
Document Type:In Proceedings
Parent Title (English):Modeling, Simulation and Optimization of Complex Processes. Proceedings of the Fourth International Conference on High Performance Scientific Computing, March 2-6, 2009, Hanoi, Vietnam
First Page:25
Last Page:39
Year of first publication:2012
Preprint:urn:nbn:de:0297-zib-11507
DOI:http://dx.doi.org/10.1007/978-3-642-25707-0_3

$Rev: 13581 $