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

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

1 2 3 ... 15 16 17 next

  1. Berthold, Timo; Witzig, Jakob: Conflict analysis for MINLP (2021)
  2. Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2021)
  3. Füllner, Christian; Kirst, Peter; Stein, Oliver: Convergent upper bounds in global minimization with nonlinear equality constraints (2021)
  4. Liberti, Leo; Sager, Sebastian; Wiegele, Angelika: Preface (2021)
  5. Liu, Yanchao: A note on solving DiDi’s driver-order matching problem (2021)
  6. Liuzzi, G.; Locatelli, M.; Piccialli, V.; Rass, S.: Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (2021)
  7. Luo, Hezhi; Ding, Xiaodong; Peng, Jiming; Jiang, Rujun; Li, Duan: Complexity results and effective algorithms for worst-case linear optimization under uncertainties (2021)
  8. Nohra, Carlos J.; Raghunathan, Arvind U.; Sahinidis, Nikolaos: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs (2021)
  9. Reyes, Victor; Araya, Ignacio: \textscAbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems (2021)
  10. Sundar, Kaarthik; Nagarajan, Harsha; Linderoth, Jeff; Wang, Site; Bent, Russell: Piecewise polyhedral formulations for a multilinear term (2021)
  11. Zenarosa, Gabriel Lopez; Prokopyev, Oleg A.; Pasiliao, Eduardo L.: On exact solution approaches for bilevel quadratic 0-1 knapsack problem (2021)
  12. Ahmadi, Amir Ali; Hall, Georgina: On the complexity of detecting convexity over a box (2020)
  13. Bienstock, Dan; Escobar, Mauro; Gentile, Claudio; Liberti, Leo: Mathematical programming formulations for the alternating current optimal power flow problem (2020)
  14. Bosch, P.; Contreras, J. P.; Munizaga-Rosas, J.: Feasibility and cost minimisation for a lithium extraction problem (2020)
  15. Cen, Xiaoli; Xia, Yong: Globally maximizing the sum of squares of quadratic forms over the unit sphere (2020)
  16. Christian D. Hubbs, Hector D. Perez, Owais Sarwar, Nikolaos V. Sahinidis, Ignacio E. Grossmann, John M. Wassick: OR-Gym: A Reinforcement Learning Library for Operations Research Problem (2020) arXiv
  17. Coniglio, Stefano; Gatti, Nicola; Marchesi, Alberto: Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case (2020)
  18. Dasdemir, Erdi; Köksalan, Murat; Tezcaner Öztürk, Diclehan: A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem (2020)
  19. Del Pia, Alberto; Khajavirad, Aida; Sahinidis, Nikolaos V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems (2020)
  20. Duarte, Belmiro P. M.; Granjo, José F. O.; Wong, Weng Kee: Optimal exact designs of experiments via mixed integer nonlinear programming (2020)

1 2 3 ... 15 16 17 next

Further publications can be found at: