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 59 articles , 1 standard article )

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

1 2 3 next

  1. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  2. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  3. Vigerske, Stefan; Gleixner, Ambros: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (2018)
  4. Zhao, Yingfeng; Zhao, Ting: A reduced space branch and bound algorithm for a class of sum of ratios problems (2018)
  5. 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)
  6. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  7. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)
  8. Cafieri, Sonia; Omheni, Riadh: Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (2017)
  9. Geißler, Björn; Morsi, Antonio; Schewe, Lars; Schmidt, Martin: Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps (2017)
  10. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  11. Kılınç, Mustafa R.; Linderoth, Jeff; Luedtke, James: Lift-and-project cuts for convex mixed integer nonlinear programs (2017)
  12. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  13. Zhao, Yingfeng; Liu, Sanyang: Global optimization algorithm for mixed integer quadratically constrained quadratic program (2017)
  14. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  15. Jakob Witzig, Timo Berthold, Stefan Heinz: Experiments with Conflict Analysis in Mixed Integer Programming (2016) arXiv
  16. Locatelli, Marco: Non polyhedral convex envelopes for 1-convex functions (2016)
  17. Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma: Polyhedral approximation in mixed-integer convex optimization (2016) arXiv
  18. Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
  19. Valle, C. A.; Meade, N.; Beasley, J. E.: An optimisation approach to constructing an exchange-traded fund (2015)
  20. Ballerstein, Martin; Michaels, Dennis: Extended formulations for convex envelopes (2014)

1 2 3 next