Pages that link to "Item:Q857362"

The following pages link to Tabu search and GRASP for the maximum diversity problem (Q857362):

Displaying 35 items.

• Multiple-path selection for new highway alignments using discrete algorithms (Q320693) (← links)
• Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
• GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
• Generalized route planning model for hazardous material transportation with VaR and equity considerations (Q336917) (← 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)
• Scatter search for the bandpass problem (Q524910) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Construction and improvement algorithms for dispersion problems (Q726217) (← links)
• A two-stage method for member selection of emergency medical service (Q887872) (← links)
• Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• Heuristics for the bi-objective path dissimilarity problem (Q1025234) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• Heuristic search to the capacitated clustering problem (Q1622798) (← links)
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← links)
• Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
• Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• \(t\)-linearization for the maximum diversity problem (Q2230803) (← 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)
• Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem (Q2448149) (← links)
• VNS variants for the Max-Mean dispersion problem (Q2631281) (← links)
• Hybrid heuristics for the maximum diversity problem (Q2655404) (← 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)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)