scientific article; zbMATH DE number 2146951
From MaRDI portal
Publication:4658641
zbMath1068.65081MaRDI QIDQ4658641
Hongang Xue, Feng-Min Xu, Cheng-Xian Xu
Publication date: 18 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convergencecomparison of methodsnumerical experimentsbranch and bound algorithms\(\omega\)-subdivision methodlarge scale separable concave programming
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (3)
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables ⋮ Mean-variance portfolio optimal problem under concave transaction cost ⋮ A branch and bound algorithm for solving a class of D-C programming
This page was built for publication:
