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.
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- A fast algorithm for the maximum weight clique problem (Q1316588) (← links)
- The maximum clique problem (Q1318271) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach (Q1330807) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- Risk transportation via a clique number problem formulation. (Q1412758) (← links)
- The composition of semi-finished inventories at a solid board plant. (Q1428051) (← links)
- Generation of lower bounds for minimum span frequency assignment (Q1602703) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Frequency-driven tabu search for the maximum \(s\)-plex problem (Q1652378) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- 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)
- 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)