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

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

1 2 3 ... 11 12 13 next

  1. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  2. Del Pia, Alberto; Khajavirad, Aida: On decomposability of multilinear sets (2018)
  3. Duarte, Belmiro P. M.; Sagnol, Guillaume; Wong, Weng Kee: An algorithm based on semidefinite programming for finding minimax optimal designs (2018)
  4. Grimstad, Bjarne: A MIQCP formulation for B-spline constraints (2018)
  5. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  6. Kronqvist, Jan; Lundell, Andreas; Westerlund, Tapio: Reformulations for utilizing separability when solving convex MINLP problems (2018)
  7. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  8. Schröder, Tim; Lauven, Lars-Peter; Geldermann, Jutta: Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy (2018)
  9. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  10. Zarrinpoor, Naeme; Fallahnezhad, Mohammad Saber; Pishvaee, Mir Saman: The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (2018)
  11. 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)
  12. Ali Askari, Ehsan; Bashiri, Mahdi: Design of a public bicycle-sharing system with safety (2017)
  13. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  14. Boland, Natashia; Dey, Santanu S.; Kalinowski, Thomas; Molinaro, Marco; Rigterink, Fabian: Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (2017)
  15. Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
  16. Cafieri, Sonia; Omheni, Riadh: Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (2017)
  17. Castro, Pedro M.: Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation (2017)
  18. Chen, Chen; Atamtürk, Alper; Oren, Shmuel S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (2017)
  19. Desai, Jitamitra; Kishore, Shalinee: A global optimization framework for distributed antenna location in CDMA cellular networks (2017)
  20. Djelassi, Hatim; Mitsos, Alexander: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (2017)

1 2 3 ... 11 12 13 next


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