Pages that link to "Item:Q2655404"

The following pages link to Hybrid heuristics for the maximum diversity problem (Q2655404):

Displaying 20 items.

• 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)
• Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
• Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
• Measuring diversity. A review and an empirical analysis (Q2029033) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A branch and bound algorithm for the maximum diversity problem (Q2379521) (← links)
• An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• VNS variants for the Max-Mean dispersion problem (Q2631281) (← 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)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• Heuristics for the capacitated dispersion problem (Q6070413) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)