Pages that link to "Item:Q4398552"

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

Displaying 35 items.

• GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
• A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
• A tabu search based memetic algorithm for the Max-Mean dispersion problem (Q342388) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• Hybrid scatter tabu search for unconstrained global optimization (Q542001) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← 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)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• On the linear ordering problem and the rankability of data (Q2072628) (← links)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← links)
• A Davidson college multi-objective assignment problem: a case study (Q2257101) (← links)
• Iterated greedy for the maximum diversity problem (Q2275623) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A branch and bound algorithm for the maximum diversity problem (Q2379521) (← links)
• Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
• An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
• Hybrid heuristics for the maximum diversity problem (Q2655404) (← links)
• A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
• Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← 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)
• Maximum diversity/similarity models with extension to part grouping (Q3025047) (← links)
• Enriching Solutions to Combinatorial Problems via Solution Engineering (Q5139605) (← links)
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)