Nam Nguyen Canh

On globally solving the maximum weighted clique problem

  • Nam Nguyen Canh
    • Categories Applications - OR and Management Sciences Tags , , , ,

    In this paper, we consider a combinatorial optimization problem, the Maximum Weighted Clique Problem (MWCP), a NP-hard problem. The considered problem is first formulated in the form of binary constrained quadratic program and then reformulated as a Difference Convex (DC) program. A global optimal solution is found by applying DC Algorithm (DCA) in combining with … Read more

    An Outcome Space Algorithm for Minimizing the Product of Two Convex Functions over a Convex Set

  • Quang Thuy Le
  • Thi Bach Kim Nguyen
  • Nam Nguyen Canh
    • Categories Global Optimization, Nonlinear Optimization Tags , , ,

    This paper presents an outcome-space outer approximation algorithm for solving the problem of minimizing the product of two convex functions over a compact convex set in $\R^n$. The computational experiences are reported. The proposed algorithm is convergent. ArticleDownload View PDF