Name
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 mix- ing constraints. We compare the solvers BARON, Couenne, SBB, and SCIP to a problem-specific algorithm on two different MIQCP formu- lations. 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. |
Year | Venue | Field |
|---|---|---|
2009 | HPSC | Quadratic growth,Mathematical optimization,Constraint integer programming,Computer science,Couenne,Algorithm,Open-pit mining,Scheduling (production processes) |
DocType | Citations | PageRank |
Conference | 5 | 0.56 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Bley | 1 | 49 | 3.04 |
| Ambros M. Gleixner | 2 | 130 | 12.49 |
| Thorsten Koch | 3 | 301 | 24.28 |
| Stefan Vigerske | 4 | 119 | 10.85 |