Pages that link to "Item:Q2630214"

The following pages link to A review on algorithms for maximum clique problems (Q2630214):

Displayed 50 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) ‎ (← links)
• Infra-chromatic bound for exact maximum clique search (Q342100) ‎ (← links)
• A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) ‎ (← links)
• A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) ‎ (← links)
• Minimum cost edge blocker clique problem (Q827246) ‎ (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) ‎ (← links)
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) ‎ (← links)
• Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) ‎ (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) ‎ (← links)
• A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) ‎ (← links)
• Differentially private nearest neighbor classification (Q1741355) ‎ (← links)
• Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs (Q1749486) ‎ (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) ‎ (← links)
• Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) ‎ (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) ‎ (← links)
• PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) ‎ (← links)
• Dominant-set clustering: a review (Q1754006) ‎ (← links)
• A new upper bound for the maximum weight clique problem (Q1754725) ‎ (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) ‎ (← links)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) ‎ (← links)
• Polyhedral properties of the induced cluster subgraphs (Q2022509) ‎ (← links)
• Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) ‎ (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) ‎ (← links)
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) ‎ (← links)
• Dynamic node packing (Q2097666) ‎ (← links)
• An SDP-based approach for computing the stability number of a graph (Q2123126) ‎ (← links)
• Boosting ant colony optimization via solution prediction and machine learning (Q2147035) ‎ (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) ‎ (← links)
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) ‎ (← links)
• A greedy algorithm to construct covering arrays using a graph representation (Q2201668) ‎ (← links)
• Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) ‎ (← links)
• Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) ‎ (← links)
• Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) ‎ (← links)
• An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) ‎ (← links)
• The triangle \(k\)-club problem (Q2359790) ‎ (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) ‎ (← links)
• Finding near-optimal independent sets at scale (Q2401330) ‎ (← links)
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (Q2401518) ‎ (← links)
• Finding disjoint dense clubs in a social network (Q2636493) ‎ (← links)
• Online summarization of dynamic graphs using subjective interestingness for sequential data (Q2659275) ‎ (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) ‎ (← links)
• BDD-based optimization for the quadratic stable set problem (Q2673237) ‎ (← links)
• A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) ‎ (← links)
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) ‎ (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) ‎ (← links)
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) ‎ (← links)
• <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) ‎ (← links)
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) ‎ (← links)
• Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) ‎ (← links)
• Correlation between the continuous-time quantum walk and cliques in graphs and its application (Q5003363) ‎ (← links)