Pages that link to "Item:Q4398552"

The following pages link to Heuristic algorithms for the maximum diversity problem (Q4398552):

Displayed 13 items.

• Hybrid scatter tabu search for unconstrained global optimization (Q542001) ‎ (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) ‎ (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) ‎ (← links)
• Tabu search and GRASP for the maximum diversity problem (Q857362) ‎ (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) ‎ (← links)
• The equitable dispersion problem (Q1011261) ‎ (← links)
• Heuristics for the bi-objective path dissimilarity problem (Q1025234) ‎ (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) ‎ (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) ‎ (← links)
• A branch and bound algorithm for the maximum diversity problem (Q2379521) ‎ (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) ‎ (← links)
• Hybrid heuristics for the maximum diversity problem (Q2655404) ‎ (← links)
• Maximum diversity/similarity models with extension to part grouping (Q3025047) ‎ (← links)