A branch and bound algorithm for a class of non-convex programming problems
From MaRDI portal
Publication:4901802
Recommendations
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- scientific article; zbMATH DE number 6310870
- scientific article; zbMATH DE number 5583854
- A branch and bound algorithm for solving a class of nonlinear integer programming problems
- A new accelerating method for globally solving a class of nonconvex programming problems
Cited in
(14)- A new global optimization algorithm for solving a class of nonconvex programming problems
- A branch and bound algorithm for solving a class of D-C programming
- A branch-and-bound based method for solving monotone optimization problems
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- scientific article; zbMATH DE number 7267266 (Why is no real title available?)
- A new modification branch-and-bound algorithm for a class of optimization programs under monotonic non-convex constraint
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Improve-and-branch algorithm for the global optimization of nonconvex NLP problems
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- scientific article; zbMATH DE number 5503918 (Why is no real title available?)
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A new accelerating method for globally solving a class of nonconvex programming problems
This page was built for publication: A branch and bound algorithm for a class of non-convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901802)
