The following pages link to The maximum clique problem (Q1318271):
Displaying 50 items.
- Metaheuristics: A bibliography (Q1919858) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms (Q2062119) (← links)
- Dynamic node packing (Q2097666) (← links)
- A Python hands-on tutorial on network and topological neuroscience (Q2117924) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (Q2283785) (← links)
- Detecting a most closeness-central clique in complex networks (Q2286965) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- On a continuous approach for the maximum weighted clique problem (Q2392119) (← links)
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Finding disjoint dense clubs in a social network (Q2636493) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Packing problems, dimensions and the tensor product of complete lattices (Q2670899) (← links)
- A pivoting-based heuristic for the maximum clique problem. (Q2768058) (← links)
- A scatter search algorithm for the maximum clique problem (Q2776559) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- DISCOVERING PAIRWISE COMPATIBILITY GRAPHS (Q3084693) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- (Q3112179) (← links)
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- The disjoint cliques problem (Q4345417) (← links)
- Neural networks for NP-complete problems (Q4377229) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning (Q4816960) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- Exact Solution Algorithms for the Chordless Cycle Problem (Q5106395) (← links)
- Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
- (Q5203914) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)
