Pages that link to "Item:Q2367014"
From MaRDI portal
The following pages link to Solving the maximum clique problem using a tabu search approach (Q2367014):
Displaying 37 items.
- Algorithmic height compression of unordered trees (Q304776) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Algorithms for the maximum \(k\)-club problem in graphs (Q385488) (← links)
- Combinatorial algorithms for the maximum \(k\)-plex problem (Q434188) (← links)
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems (Q439496) (← links)
- Finding large \(k\)-clubs in undirected graphs (Q488393) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- Facets for node packing (Q1278997) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
- The maximum clique problem (Q1318271) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
- On biconnected and fragile subgraphs of low diameter (Q1694912) (← links)
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club (Q2820114) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
