Cutting Planes for Low-Rank-Like Concave Minimization Problems
From MaRDI portal
Publication:5322008
DOI10.1287/opre.1040.0151zbMath1165.90595MaRDI QIDQ5322008
Publication date: 17 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1040.0151
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
Related Items
A new Lagrangian-Benders approach for a concave cost supply chain network design problem, An FPTAS for optimizing a class of low-rank functions over a polytope, Linear decomposition approach for a class of nonconvex programming problems, The hill detouring method for minimizing hinging hyperplanes functions