A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts

DOI10.1023/B:JOGO.0000042113.68493.DAzbMath1084.90047MaRDI QIDQ1888145

Marcus Porembski

Publication date: 22 November 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Concave minimizationcone decompositiondecomposition cutsuccessive partition

Mathematics Subject Classification ID

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

This page was built for publication: A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts