Pages that link to "Item:Q2356110"

The following pages link to A hybrid metaheuristic method for the maximum diversity problem (Q2356110):

Displaying 13 items.

• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
• The balanced maximally diverse grouping problem with block constraints (Q2031070) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• Maximization problems of balancing submodular relevance and supermodular diversity (Q2070370) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
• A review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) (← links)
• A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)