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

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

1 2 3 ... 13 14 15 next

  1. Bosch, P.; Contreras, J. P.; Munizaga-Rosas, J.: Feasibility and cost minimisation for a lithium extraction problem (2020)
  2. 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)
  3. Enayati, Shakiba; Özaltın, Osman Y.: Optimal influenza vaccine distribution with equity (2020)
  4. Fischetti, Matteo; Monaci, Michele: A branch-and-cut algorithm for mixed-integer bilinear programming (2020)
  5. Gleixner, Ambros; Maher, Stephen J.; Müller, Benjamin; Pedroso, João Pedro: Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (2020)
  6. Goos, P.; Syafitri, U.; Sartono, B.; Vazquez, A. R.: A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (2020)
  7. Marandi, Ahmadreza; de Klerk, Etienne; Dahl, Joachim: Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy (2020)
  8. Marendet, Antoine; Goldsztejn, Alexandre; Chabert, Gilles; Jermann, Christophe: A standard branch-and-bound approach for nonlinear semi-infinite problems (2020)
  9. Ahmadi, Amir Ali; Majumdar, Anirudha: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization (2019)
  10. Amaral, Paula Alexandra; Bomze, Immanuel M.: Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations (2019)
  11. Andrade, Tiago; Oliveira, Fabricio; Hamacher, Silvio; Eberhard, Andrew: Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (2019)
  12. Bei, Xiaoqiang; Zhu, Xiaoyan; Coit, David W.: A risk-averse stochastic program for integrated system design and preventive maintenance planning (2019)
  13. Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
  14. Caballero, William N.; Lunday, Brian J.: Influence modeling: mathematical programming representations of persuasion under either risk or uncertainty (2019)
  15. Cicek, Cihan Tugrul; Gultekin, Hakan; Tavli, Bulent: The location-allocation problem of drone base stations (2019)
  16. D’Ambrosio, Claudia; Lee, Jon; Liberti, Leo; Ovsjanikov, Maks: Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization (2019)
  17. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  18. Gronski, Jessica; Ben Sassi, Mohamed-Amin; Becker, Stephen; Sankaranarayanan, Sriram: Template polyhedra and bilinear optimization (2019)
  19. Hante, Falk M.; Schmidt, Martin: Complementarity-based nonlinear programming techniques for optimal mixing in gas networks (2019)
  20. Kallrath, Josef; Frey, Markus M.: Packing circles into perimeter-minimizing convex hulls (2019)

1 2 3 ... 13 14 15 next

Further publications can be found at: