Pages that link to "Item:Q2184091"
From MaRDI portal
The following pages link to An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091):
Displaying 7 items.
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems (Q1273655) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)
- On finding the community with maximum persistence probability (Q6655141) (← links)