BARON

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 264 articles , 2 standard articles )

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

1 2 3 ... 12 13 14 next

  1. Bei, Xiaoqiang; Zhu, Xiaoyan; Coit, David W.: A risk-averse stochastic program for integrated system design and preventive maintenance planning (2019)
  2. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  3. Wang, Tong; Lima, Ricardo M.; Giraldi, Loïc; Knio, Omar M.: Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (2019)
  4. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  5. Ciripoi, Daniel; Löhne, Andreas; Weißing, Benjamin: A vector linear programming approach for certain global optimization problems (2018)
  6. Del Pia, Alberto; Khajavirad, Aida: On decomposability of multilinear sets (2018)
  7. Duarte, Belmiro P. M.; Sagnol, Guillaume; Wong, Weng Kee: An algorithm based on semidefinite programming for finding minimax optimal designs (2018)
  8. Gergel, Victor; Barkalov, Konstantin; Sysoyev, Alexander: Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (2018)
  9. Grimstad, Bjarne: A MIQCP formulation for B-spline constraints (2018)
  10. Hartillo, M. I.; Jiménez-Cobano, J. M.; Ucha, J. M.: Finding multiple solutions in nonlinear integer programming with algebraic test-sets (2018)
  11. Keyanpour, Mohammad; Osmanpour, Naser: On solving quadratically constrained quadratic programming problem with one non-convex constraint (2018)
  12. Khajavirad, Aida; Sahinidis, Nikolaos V.: A hybrid LP/NLP paradigm for global optimization relaxations (2018)
  13. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  14. Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: Reformulations for utilizing separability when solving convex MINLP problems (2018)
  15. Lim, Cong Han; Linderoth, Jeff; Luedtke, James: Valid inequalities for separable concave constraints with indicator variables (2018)
  16. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  17. Nohra, Carlos J.; Sahinidis, Nikolaos V.: Global optimization of nonconvex problems with convex-transformable intermediates (2018)
  18. Schröder, Tim; Lauven, Lars-Peter; Geldermann, Jutta: Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy (2018)
  19. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  20. Speakman, Emily; Lee, Jon: On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (2018)

1 2 3 ... 12 13 14 next


Further publications can be found at: http://scholar.google.gr/citations?hl=en&user=PTXe50QAAAAJ