scientific article; zbMATH DE number 2146951

zbMATH Open1068.65081MaRDI QIDQ4658641FDOQ4658641

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

Publication date: 18 March 2005

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

convergencenumerical experimentscomparison of methodsbranch and bound algorithms\(\omega\)-subdivision methodlarge scale separable concave programming

Mathematics Subject Classification ID

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

Cited In (13)

• An Algorithm for Separable Nonconvex Programming Problems
• Reducing Separable Convex Programs with Tree Constraints
• A branch and bound method for solving integer separable concave problems
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
• A branch and bound algorithm for integer separable concave programs
• Title not available (Why is that?)
• A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
• Mean-variance portfolio optimal problem under concave transaction cost
• A branch and bound algorithm for solving a class of D-C programming
• Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
• A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
• A finite concave minimization algorithm using branch and bound and neighbor generation

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)