Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • Treffer 5 von 14
Zurück zur Trefferliste

Analyzing the computational impact of MIQCP solver components

Zitieren Sie bitte immer diese URN: urn:nbn:de:0297-zib-17754
  • We provide a computational study of the performance of a state-of-the-art solver for nonconvex mixed-integer quadratically constrained programs (MIQCPs). Since successful general-purpose solvers for large problem classes necessarily comprise a variety of algorithmic techniques, we focus especially on the impact of the individual solver components. The solver SCIP used for the experiments implements a branch-and-cut algorithm based on a linear relaxation to solve MIQCPs to global optimality. Our analysis is based on a set of 86 publicly available test instances.

Volltext Dateien herunterladen

Metadaten exportieren

Metadaten
Verfasserangaben:Timo BertholdORCiD, Ambros GleixnerORCiD, Stefan Heinz, Stefan Vigerske
Dokumentart:ZIB-Report
Freies Schlagwort / Tag:branch-and-cut; global optimization; mixed-integer programming; mixed-integer quadratically constrained programming; nonconvex
MSC-Klassifikation:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C11 Mixed integer programming
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C26 Nonconvex programming, global optimization
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C30 Nonlinear programming
Datum der Erstveröffentlichung:14.02.2013
Schriftenreihe (Bandnummer):ZIB-Report (13-08)
ISSN:1438-0064
Verlagspublikation:Appeared in: Numerical Algebra, Control and Optimization vol. 2, no. 4 (2012) pp. 739-748
DOI:https://doi.org/10.3934/naco.2012.2.739
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.