• QUALEX

  • Referenced in 51 articles [sw04742]
  • trust region technique for the maximum weight clique problem A new simple generalization ... Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within ... benchmark graphs and various random maximum weight clique problem instances...
  • Max-AO

  • Referenced in 22 articles [sw05032]
  • relaxations of maximum stable set and maximum clique problems,graph input...
  • BHOSLIB

  • Referenced in 18 articles [sw08220]
  • with Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover...
  • SCCWalk

  • Referenced in 4 articles [sw32102]
  • algorithm and its improvements for maximum weight clique problem. The maximum weight clique problem (MWCP ... important generalization of the maximum clique problem with wide applications. In this study, we develop...
  • gpuls-mwcp

  • Referenced in 5 articles [sw41468]
  • local search heuristic for the maximum weight clique problem on massive graphs. Given an undirected ... weights on the vertices, the maximum weight clique problem (MWCP) consists in finding a clique ... neighborhood structures for the problem. These neighborhoods are explored using an efficient procedure that...
  • ils-mwis

  • Referenced in 8 articles [sw41470]
  • generalization of the classical maximum independent set problem. Two efficient neighborhood structures are proposed ... best heuristics for the maximum weight clique problem. The results also show that the hybrid...
  • BBMCSP

  • Referenced in 10 articles [sw17718]
  • very efficient branch-and-bound exact maximum clique algorithm BBMCSP, designed for large and massive ... real life problems from different fields. State-of-the-art exact maximum clique algorithms encode...
  • PMC

  • Referenced in 1 article [sw21471]
  • tight linear time bounds for the maximum clique problem. Ordering of vertices for each algorithm...
  • HEWN

  • Referenced in 3 articles [sw02189]
  • CLIQUE problem. A Hierarchical Edge-Weighted Network (HEWN) which is equivalent to the corresponding Maximum ... built and hence the size of maximal clique is found. It is proved that HEWN...
  • NuMVC

  • Referenced in 13 articles [sw08219]
  • Local search has proved successful for this problem. However, there are two main drawbacks ... current best exact algorithm for Maximum Clique on random instances as well as some structured...
  • GraphCombEx

  • Referenced in 0 articles [sw32090]
  • design. The problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex ... well as the longest simple cycle problem. Suboptimal solutions and intervals for optimal objective values...
  • BBMCW

  • Referenced in 4 articles [sw21469]
  • describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which ... penalty. These graphs occur in real-life problems when some form of locality...
  • BITSCAN

  • Referenced in 3 articles [sw21470]
  • years of research in combinatorial optimization problems and has been shown very useful when modelling ... efficient state of the art maximum clique algorithm. It has also been applied in PASS...
  • IncMaxCLQ

  • Referenced in 1 article [sw21468]
  • bounds for the cardinality of a maximum clique of a graph. However, existing upper bounds ... hardness of the MaxSAT problem, MaxSAT reasoning generally cannot be complete at a node...
  • CoCoA

  • Referenced in 654 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

  • Referenced in 3189 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • LAPACK

  • Referenced in 1702 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...