Pages that link to "Item:Q922964"
From MaRDI portal
The following pages link to An exact algorithm for the maximum clique problem (Q922964):
Displaying 50 items.
- Maximum weight relaxed cliques and Russian doll search revisited (Q1686057) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- On identifying dominant cliques. (Q1811147) (← links)
- On solving the maximum clique problem (Q1850827) (← links)
- Modelling competitive Hopfield networks for the maximum clique problem (Q1870811) (← links)
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← 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)
- Metric space method for constructing splitting partitions of graphs (Q2178736) (← 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)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- A fast discovery algorithm for large common connected induced subgraphs (Q2274094) (← links)
- A GPU based local search algorithm for the unweighted and weighted maximum \(s\)-plex problems (Q2288976) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Algorithms for the generalized independent set problem based on a quadratic optimization approach (Q2329644) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A simple simulated annealing algorithm for the maximum clique problem (Q2456476) (← links)
- Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates (Q2459394) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- Novel approaches for analyzing biological networks (Q2576439) (← links)
- Edge coloring of graphs, uses, limitation, complexity (Q2629566) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- A new algorithm for the maximum-weight clique problem (Q2741359) (← links)
- Discrete optimization with decision diagrams (Q2806864) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements (Q2820111) (← links)
