Mathematical Programming

, Volume 103, Issue 2, pp 335–356

A comparison of complete global optimization solvers

  • Arnold Neumaier
  • Oleg Shcherbina
  • Waltraud Huyer
  • Tamás Vinkó
Article

DOI: 10.1007/s10107-005-0585-4

Cite this article as:
Neumaier, A., Shcherbina, O., Huyer, W. et al. Math. Program. (2005) 103: 335. doi:10.1007/s10107-005-0585-4
  • 511 Downloads

Abstract.

Results are reported of testing a number of existing state of the art solvers for global constrained optimization and constraint satisfaction on a set of over 1000 test problems in up to 1000 variables, collected from the literature.

The test problems are available online in AMPL and were translated into the input formats of the various solvers using routines from the COCONUT environment. These translators are available online, too.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Arnold Neumaier
    • 1
  • Oleg Shcherbina
    • 1
  • Waltraud Huyer
    • 1
  • Tamás Vinkó
    • 2
  1. 1.Fakultät für MathematikUniversität WienWienAustria
  2. 2.Research Group on Artificial Intelligence of the Hungarian Academy of SciencesUniversity of SzegedSzegedHungary

Personalised recommendations