Pages that link to "Item:Q1360111"

The following pages link to Computational aspects of the maximum diversity problem (Q1360111):

Displaying 36 items.

• An integer programming approach for solving the \(p\)-dispersion problem (Q323154) (← links)
• GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
• \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis (Q337587) (← links)
• A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
• Subset selection from large datasets for kriging modeling (Q381304) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
• Tabu search and GRASP for the maximum diversity problem (Q857362) (← links)
• A two-stage method for member selection of emergency medical service (Q887872) (← links)
• Tabu search versus GRASP for the maximum diversity problem (Q926570) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• Approximation algorithms for maximum dispersion (Q1375119) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem (Q1701982) (← 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)
• The maximum diversity assortment selection problem (Q2040441) (← 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)
• 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)
• A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem (Q3195327) (← links)
• Applications of the DM‐GRASP heuristic: a survey (Q3546241) (← links)
• Heuristic algorithms for the maximum diversity problem (Q4398552) (← links)
• Lagrangian solution of maximum dispersion problems (Q4949160) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)