MINLPLib

MINLPLib -- a collection of test models for mixed-integer nonlinear programming. The paper describes a new computerized collection of test models for mixed-integer nonlinear programming. Because there is no standard format for nonlinear models, the model collection is augmented with a translation server that can transform the models from their basic GAMS format into other formats, including AMPL, BARON, LGO, LINGO, and MINOPT. The translation server can also be used to transform industrial models that contain confidential information. Such transformations allow many of these models to be distributed to the research community as highly relevant algorithmic test models.


References in zbMATH (referenced in 75 articles , 1 standard article )

Showing results 1 to 20 of 75.
Sorted by year (citations)

1 2 3 4 next

  1. Burlacu, Robert; Geißler, Björn; Schewe, Lars: Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes (2020)
  2. Fischetti, Matteo; Monaci, Michele: A branch-and-cut algorithm for mixed-integer bilinear programming (2020)
  3. Kronqvist, Jan; Bernal, David E.; Grossmann, Ignacio E.: Using regularization and second order information in outer approximation for convex MINLP (2020)
  4. Muts, Pavlo; Nowak, Ivo; Hendrix, Eligius M. T.: The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (2020)
  5. Neumann, Christoph; Stein, Oliver; Sudermann-Merx, Nathan: Granularity in nonlinear mixed-integer optimization (2020)
  6. Zhang, Yi; Sahinidis, Nikolaos V.; Nohra, Carlos; Rong, Gang: Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (2020)
  7. Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos V.; Vigerske, Stefan; Wiegele, Angelika: QPLIB: a library of quadratic programming instances (2019)
  8. Liu, Jianfeng; Ploskas, Nikolaos; Sahinidis, Nikolaos V.: Tuning BARON using derivative-free optimization algorithms (2019)
  9. Nagarajan, Harsha; Lu, Mowen; Wang, Site; Bent, Russell; Sundar, Kaarthik: An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (2019)
  10. Schewe, Lars; Schmidt, Martin: Computing feasible points for binary MINLPs with MPECs (2019)
  11. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  12. Costa, Alberto; Nannicini, Giacomo: RBFOpt: an open-source library for black-box optimization with costly function evaluations (2018)
  13. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  14. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  15. Lubin, Miles; Yamangil, Emre; Bent, Russell; Vielma, Juan Pablo: Polyhedral approximation in mixed-integer convex optimization (2018)
  16. Melo, Wendel; Fampa, Marcia; Raupp, Fernanda: Integrality gap minimization heuristics for binary mixed integer nonlinear programming (2018)
  17. Nohra, Carlos J.; Sahinidis, Nikolaos V.: Global optimization of nonconvex problems with convex-transformable intermediates (2018)
  18. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  19. Zhao, Yingfeng; Zhao, Ting: A reduced space branch and bound algorithm for a class of sum of ratios problems (2018)
  20. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)

1 2 3 4 next