Finitely convergent cutting planes for concave minimization
From MaRDI portal
Publication:5954662
DOI10.1023/A:1011240309783zbMath1040.90050OpenAlexW1579573277MaRDI QIDQ5954662
Publication date: 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011240309783
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
This page was built for publication: Finitely convergent cutting planes for concave minimization