Pages that link to "Item:Q2275623"

The following pages link to Iterated greedy for the maximum diversity problem (Q2275623):

Displaying 15 items.

• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
• The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
• An iterated greedy heuristic for a market segmentation problem with multiple attributes (Q1753559) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• Optimizing node infiltrations in complex networks by a local search based heuristic (Q2273672) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← 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)
• The stochastic pseudo-star degree centrality problem (Q6112539) (← links)
• Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)