A branch and bound algorithm for integer separable concave programs

MaRDI QIDQ3409662zbMATH OpenFDO

Authors Xiaohua Ma, Chongmin Lei, Yuelin Gao

Publication date 20 November 2006

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2146951
• A branch and bound method for solving integer separable concave problems
• A branch and bound algorithm for solving separable convex integer programming problems
• A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
• A branch and bound algorithm for solving a class of nonlinear integer programming problems

Cited in

(10)

• A branch and bound algorithm for solving separable convex integer programming problems
• A branch and bound method for solving integer separable concave problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• A branch and bound algorithm for solving a class of nonlinear integer programming problems
• scientific article; zbMATH DE number 4008100 (Why is no real title available?)
• scientific article; zbMATH DE number 4064768 (Why is no real title available?)
• scientific article; zbMATH DE number 2146951 (Why is no real title available?)
• A combination of linear approximation and Lagrangian dual with a simple cut for general separable integer programming problems
• A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems
• scientific article; zbMATH DE number 970356 (Why is no real title available?)

This page was built for publication: A branch and bound algorithm for integer separable concave programs

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