Pages that link to "Item:Q358651"

The following pages link to An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651):

Displaying 21 items.

• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• Breakout local search for maximum clique problems (Q339563) (← links)
• A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
• A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
• A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
• A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
• A Metaheuristic Approach for an Optimized Design of a Silicon Carbide Operational Amplifier (Q4562635) (← links)
• An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
• Team selection for prediction tasks (Q5963648) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)