A branch and bound algorithm for a class of non-convex programming problems

zbMATH Open1265.90342MaRDI QIDQ4901802FDOQ4901802

Authors: Xiaoai Li, Yuhua Chen, Peiping Shen 

Publication date: 24 January 2013

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

zbMATH Keywords

global optimizationbranch and boundnon-convex programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Cited In (14)

• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new accelerating method for globally solving a class of nonconvex programming problems
• A branch-and-bound based method for solving monotone optimization problems
• A new global optimization algorithm for solving a class of nonconvex programming problems
• 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 solving a class of D-C programming
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A new branching rule for the branch and bound algorithms for solving nonlinear integer 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)