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

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

1 2 3 next

  1. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  2. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)
  3. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  4. Zhao, Yingfeng; Liu, Sanyang: Global optimization algorithm for mixed integer quadratically constrained quadratic program (2017)
  5. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  6. Jakob Witzig, Timo Berthold, Stefan Heinz: Experiments with Conflict Analysis in Mixed Integer Programming (2016) arXiv
  7. Locatelli, Marco: Non polyhedral convex envelopes for 1-convex functions (2016)
  8. Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma: Polyhedral approximation in mixed-integer convex optimization (2016) arXiv
  9. Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
  10. Valle, C.A.; Meade, N.; Beasley, J.E.: An optimisation approach to constructing an exchange-traded fund (2015)
  11. Ballerstein, Martin; Michaels, Dennis: Extended formulations for convex envelopes (2014)
  12. Berthold, Timo: RENS. The optimal rounding (2014)
  13. Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
  14. Bussieck, Michael R.; Dirkse, Steven P.; Vigerske, Stefan: PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (2014)
  15. Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
  16. Kılınç, Mustafa; Linderoth, Jeff; Luedtke, James; Miller, Andrew: Strong-branching inequalities for convex mixed integer nonlinear programs (2014)
  17. Liberti, Leo; Ostrowski, James: Stabilizer-based symmetry breaking constraints for mathematical programs (2014)
  18. López, C.O.; Beasley, J.E.: A note on solving MINLP’s using formulation space search (2014)
  19. Misener, Ruth; Floudas, Christodoulos A.: A framework for globally optimizing mixed-integer signomial programs (2014)
  20. Misener, Ruth; Floudas, Christodoulos A.: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (2014)

1 2 3 next