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

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

1 2 3 ... 10 11 12 next

  1. Berthold, Timo: A computational study of primal heuristics inside an MI(NL)P solver (2018)
  2. Schröder, Tim; Lauven, Lars-Peter; Geldermann, Jutta: Improving biorefinery planning: integration of spatial data using exact optimization nested in an evolutionary strategy (2018)
  3. 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)
  4. 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)
  5. Ali Askari, Ehsan; Bashiri, Mahdi: Design of a public bicycle-sharing system with safety (2017)
  6. Andrea Callia D’Iddio, Michael Huth: Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving (2017) arXiv
  7. 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)
  8. Bongartz, Dominik; Mitsos, Alexander: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (2017)
  9. Castro, Pedro M.: Spatial branch-and-bound algorithm for MIQCPs featuring multiparametric disaggregation (2017)
  10. Chen, Chen; Atamtürk, Alper; Oren, Shmuel S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (2017)
  11. Desai, Jitamitra; Kishore, Shalinee: A global optimization framework for distributed antenna location in CDMA cellular networks (2017)
  12. Djelassi, Hatim; Mitsos, Alexander: A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs (2017)
  13. Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
  14. Hanks, Robert W.; Weir, Jeffery D.; Lunday, Brian J.: Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets (2017)
  15. Harwood, Stuart M.; Barton, Paul I.: How to solve a design centering problem (2017)
  16. Khan, Kamil A.; Watson, Harry A.J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  17. Krislock, Nathan; Malick, Jér^ome; Roupin, Frédéric: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems (2017)
  18. Lee, Jon; Skipper, Daphne: Virtuous smoothing for global optimization (2017)
  19. Lombardi, Michele; Milano, Michela; Bartolini, Andrea: Empirical decision model learning (2017)
  20. Newby, Eric; Ali, M.M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs (2017)

1 2 3 ... 10 11 12 next


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