A branch and bound method for solving integer separable concave problems
From MaRDI portal
Publication:1415483
DOI10.1023/A:1025746430535zbMath1043.90050MaRDI QIDQ1415483
Publication date: 4 December 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46)
This page was built for publication: A branch and bound method for solving integer separable concave problems