scientific article; zbMATH DE number 2146951

MaRDI QIDQ4658641zbMATH OpenFDO

Authors Hongang Xue, Cheng-Xian Xu, Feng-Min Xu

Publication date 18 March 2005

zbMATH Keywords

\(\omega\)-subdivision methodbranch and bound algorithmscomparison of methodsconvergencelarge scale separable concave programmingnumerical experiments

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm for integer separable concave programs
• A branch and bound method for solving integer separable concave problems
• scientific article; zbMATH DE number 970356
• A branch and bound algorithm for solving separable convex integer programming problems
• A finite algorithm for global minimization of separable concave programs

Cited in

(17)

• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
• A finite concave minimization algorithm using branch and bound and neighbor generation
• A finite algorithm for global minimization of separable concave programs
• A branch and bound method for solving integer separable concave problems
• A branch and bound algorithm for solving a class of D-C programming
• Mean-variance portfolio optimal problem under concave transaction cost
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• Reducing Separable Convex Programs with Tree Constraints
• A branch and bound algorithm for integer separable concave programs
• scientific article; zbMATH DE number 4164560 (Why is no real title available?)
• A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
• A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
• An Algorithm for Separable Nonconvex Programming Problems
• scientific article; zbMATH DE number 970356 (Why is no real title available?)
• A monotonic optimization approach to mixed variational inequality problems
• Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658641)