2 papers
math.OC2021
Convex Formulation for Planted Quasi-Clique Recovery
Sakirudeen A. Abdulsalaam, M. Montaz Ali
In this paper, we consider the planted quasi-clique or γ-clique problem. This problem is an extension of the well known planted clique problem which is NP-hard. The maximum quasi-c…
math.OC2015
Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint
Zhou Wei, M. Montaz Ali
In this paper, we mainly study one class of mixed-integer nonlinear programming problems (MINLPs) with vector conic constraint in Banach spaces. Duality theory of convex vector opt…