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

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

1 2 3 ... 16 17 18 next

  1. Baayen, Jorn H.; Postek, Krzysztof: Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control (2022)
  2. Bruglieri, Maurizio; Cordone, Roberto; Liberti, Leo: Maximum feasible subsystems of distance geometry constraints (2022)
  3. Gade, Jan-Lucas; Thore, Carl-Johan; Stålhand, Jonas: Identification of mechanical properties of arteries with certification of global optimality (2022)
  4. Haywood, Adam B.; Lunday, Brian J.; Robbins, Matthew J.; Pachter, Meir N.: The weighted intruder path covering problem (2022)
  5. Jiao, Hongwei; Shang, Youlin; Wang, Wenjie: Solving generalized polynomial problem by using new affine relaxed technique (2022)
  6. Monnet, Dominique; Goldsztejn, Alexandre; Plestan, Franck: Generalization of the twisting convergence conditions to non-affine systems (2022)
  7. Ploskas, Nikolaos; Sahinidis, Nikolaos V.: Review and comparison of algorithms and software for mixed-integer derivative-free optimization (2022)
  8. Sharma, Meenarli; Palkar, Prashant; Mahajan, Ashutosh: Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (2022)
  9. Wang, Chunfeng; Deng, Yaping; Shen, Peiping: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (2022)
  10. Allman, Andrew; Zhang, Qi: Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (2021)
  11. Anstreicher, Kurt M.; Burer, Samuel; Park, Kyungchan: Convex hull representations for bounded products of variables (2021)
  12. Aouam, Tarik; Ghadimi, Foad; Vanhoucke, Mario: Finite inventory budgets in production capacity and safety stock placement under the guaranteed service approach (2021)
  13. Berthold, Timo; Witzig, Jakob: Conflict analysis for MINLP (2021)
  14. Bonvin, Gratien; Demassey, Sophie; Lodi, Andrea: Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (2021)
  15. Cerulli, Martina; D’Ambrosio, Claudia; Liberti, Leo; Pelegrín, Mercedes: Detecting and solving aircraft conflicts using bilevel programming (2021)
  16. Del Pia, Alberto; Khajavirad, Aida: The running intersection relaxation of the multilinear polytope (2021)
  17. Elloumi, Sourour; Lambert, Amélie; Lazare, Arnaud: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2021)
  18. Füllner, Christian; Kirst, Peter; Stein, Oliver: Convergent upper bounds in global minimization with nonlinear equality constraints (2021)
  19. Gabriel, Steven A.; Leal, Marina; Schmidt, Martin: Solving binary-constrained mixed complementarity problems using continuous reformulations (2021)
  20. He, Sicheng; Shahabsafa, Mohammad; Lei, Weiming; Mohammad-Nezhad, Ali; Terlaky, Tamás; Zuluaga, Luis; Martins, Joaquim R. R. A.: Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems (2021)

1 2 3 ... 16 17 18 next

Further publications can be found at: