Pages that link to "Item:Q1761843"

The following pages link to Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843):

Displaying 25 items.

• Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem (Q306092) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
• A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs (Q1652526) (← links)
• Graph multi-coloring for a job scheduling application (Q1686066) (← links)
• Variable neighborhood search: basics and variants (Q1707084) (← links)
• A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
• PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• Metaheuristics for a scheduling problem with rejection and tardiness penalties (Q2018941) (← links)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs (Q2175041) (← links)
• General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (Q2177818) (← 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 review on algorithms for maximum clique problems (Q2630214) (← links)
• Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem (Q2673245) (← links)
• Models and algorithms for the weighted safe set problem (Q2686129) (← links)
• A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229) (← links)
• An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
• On solving simplified diversified top-\(k\,s\)-plex problem (Q6164387) (← links)