A branch and bound method for solving integer separable concave problems

DOI10.1023/A:1025746430535MaRDI QIDQ1415483zbMATH OpenFDO

Authors D. Massart, Oscar Barrientos, Rafael Correa, Patricio Reyes, Abel Valdebenito

Publication date 4 December 2003

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL http://americanae.aecid.es/americanae/es/registros/registro.do?tipoRegistro=MTD&idBib=3270027

zbMATH Keywords

branch and bound methodsconcave programsLagrangian dualityNP-hard problems

Mathematics Subject Classification ID

Integer programming (90C10) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm for integer separable concave programs
• A branch and bound algorithm for solving separable convex integer programming problems
• scientific article; zbMATH DE number 2146951
• A combination of linear approximation and Lagrangian dual with a simple cut for general separable integer programming problems
• A branch and bound algorithm for solving a class of nonlinear integer programming problems

Cited in

(8)

• A branch and bound algorithm for solving separable convex integer programming problems
• Utilizing the surrogate dual bound in capacity planning with economies of scale
• A branch and bound algorithm for integer separable concave programs
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• scientific article; zbMATH DE number 3974726 (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

This page was built for publication: A branch and bound method for solving integer separable concave problems

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