Pages that link to "Item:Q1009196"
From MaRDI portal
The following pages link to Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196):
Displaying 13 items.
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- SQBC: an efficient subgraph matching method over large and dense graphs (Q903609) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Minimum energy target tracking with coverage guarantee in wireless sensor networks (Q1681141) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
