Pages that link to "Item:Q922964"
From MaRDI portal
The following pages link to An exact algorithm for the maximum clique problem (Q922964):
Displayed 50 items.
- Permutation codes with specified packing radius (Q356723) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs (Q448967) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- A new table of permutation codes (Q766240) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- 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)
- \(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)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← 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)
- An effective and fast heuristic for the dial-a-ride problem (Q2644373) (← links)
- Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325) (← links)
- Clique algorithms for classifying substructures in generalized quadrangles (Q3439132) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)