The Maximum Weighted Clique Problem (MWCP) and Maximum Clique Problem(MCP) are considered here as the problem with nonconvex quadratic constraint given by difference of two convex functions (d.c.function).For solving MWCP and MCP an algorithm based on Global Optimality Conditions is applied.
Alan : Fen Bilimleri ve Matematik
Dergi Türü : Uluslararası
Benzer Makaleler | Yazar | # |
---|
Makale | Yazar | # |
---|