Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling

Andreas Bley (), Ambros M. Gleixner (), Thorsten Koch () and Stefan Vigerske ()
Additional contact information
Andreas Bley: Technische Universität Berlin
Ambros M. Gleixner: Zuse Institute Berlin
Thorsten Koch: Zuse Institute Berlin
Stefan Vigerske: Humboldt-Universität zu Berlin

A chapter in Modeling, Simulation and Optimization of Complex Processes, 2012, pp 25-39 from Springer

Abstract: Abstract This paper investigates 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.

Keywords: Dual Bound; Mixed Integer Nonlinear Programming; Benchmark Algorithm; Nonconvex MINLPs; Constraint Integer Programming (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-25707-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783642257070

DOI: 10.1007/978-3-642-25707-0_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().