Pages that link to "Item:Q763098"
From MaRDI portal
The following pages link to An efficient memetic algorithm for the graph partitioning problem (Q763098):
Displayed 7 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Tabu search for the cyclic bandwidth problem (Q337475) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)