BARON is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer nonlinear problems can be solved with the software. The Branch And Reduce Optimization Navigator derives its name from its combining constraint propagation, interval analysis, and duality in its reduce arsenal with enhanced branch and bound concepts as it winds its way through the hills and valleys of complex optimization problems in search of global solutions

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

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

1 2 3 ... 9 10 11 next

  1. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  2. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  3. Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)
  4. Birgin, E.G.; Lobato, R.D.; Martínez, J.M.: Packing ellipsoids by nonlinear optimization (2016)
  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. Brás, Carmo; Eichfelder, Gabriele; Júdice, Joaquim: Copositivity tests based on the linear complementarity problem (2016)
  7. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  8. Caprara, Alberto; Locatelli, Marco; Monaci, Michele: Theoretical and computational results about optimality-based domain reductions (2016)
  9. Castro, Pedro M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (2016)
  10. Costa, Alberto; Kushnarev, Sergey; Liberti, Leo; Sun, Zeyu: Divisive heuristic for modularity density maximization (2016)
  11. Cui, Xueting; Zhu, Shushang; Li, Duan; Sun, Jie: Mean-variance portfolio optimization with parameter sensitivity control (2016)
  12. Dalkiran, Evrim; Sherali, Hanif D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (2016)
  13. de Klerk, Etienne: Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization (2016)
  14. Domes, Ferenc; Neumaier, Arnold: Constraint aggregation for rigorous global optimization (2016)
  15. Haugh, Martin; Iyengar, Garud; Wang, Chun: Tax-aware dynamic asset allocation (2016)
  16. Hellemo, Lars; Tomasgard, Asgeir: A generalized global optimization formulation of the pooling problem with processing facilities and composite quality constraints (2016)
  17. Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (2016)
  18. Lejeune, Miguel A.; Margot, François: Solving chance-constrained optimization problems with stochastic quadratic inequalities (2016)
  19. Newby, Eric; Ali, M.Montaz: Transformation-based preprocessing for mixed-integer quadratic programs (2016)
  20. Niknamfar, Amir Hossein; Niaki, Seyed Taghi Akhavan: Soft time-windows for a bi-objective vendor selection problem under a multi-sourcing strategy: binary-continuous differential evolution (2016)

1 2 3 ... 9 10 11 next

Further publications can be found at: