Generalized \(\gamma\)-valid cut procedure for concave minimization

DOI10.1023/A:1021776323080zbMath0937.90084OpenAlexW1498979476MaRDI QIDQ1807817

Harold P. Benson

Publication date: 14 June 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021776323080

zbMATH Keywords

global optimizationconcave minimization\(\gamma\)-valid cutTuy cut

Mathematics Subject Classification ID

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

Related Items (1)

Two-Stage Optimization Problems with Multivariate Stochastic Order Constraints

Cites Work

• Checking local optimality in constrained quadratic programming is NP- hard
• A new pivoting rule for solving various degeneracy problems
• Methods for Global Concave Minimization: A Bibliographic Survey
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized \(\gamma\)-valid cut procedure for concave minimization