<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1150</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>ZIB</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2009-10-15</completedDate>
    <publishedDate>2009-10-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Comparing MIQCP solvers to a specialised algorithm for mine production scheduling</title>
    <abstract language="eng">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.</abstract>
    <identifier type="serial">09-32</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1206</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11507</identifier>
    <identifier type="doi">10.1007/978-3-642-25707-0</identifier>
    <enrichment key="SourceTitle">Appeared in: Modeling, Simulation and Optimization of Complex Processes, Proc. of the 4th Int. Conf. on High Performance Scientific Computing, 2009, Hanoi, Vietnam. H. G. Bock et al. (eds.) 2012, pp. 25-39</enrichment>
    <author>Andreas Bley</author>
    <submitter>unknown unknown</submitter>
    <author>Ambros Gleixner</author>
    <author>Thorsten Koch</author>
    <author>Stefan Vigerske</author>
    <series>
      <title>ZIB-Report</title>
      <number>09-32</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B30">Production models</collection>
    <collection role="msc" number="90B35">Scheduling theory, deterministic [See also 68M20]</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C26">Nonconvex programming, global optimization</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="persons" number="vigerske">Vigerske, Stefan</collection>
    <collection role="projects" number="MATHEON-B19:MINLP">MATHEON-B19:MINLP</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="Siemens">Siemens</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1150/ZR_09_32.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1150/ZR_09_32.ps</file>
  </doc>
</export-example>
