Computational aspects of the maximum diversity problem
From MaRDI portal
Publication:1360111
DOI10.1016/0167-6377(96)00025-9zbMath0873.90070OpenAlexW2164719474MaRDI QIDQ1360111
Publication date: 15 July 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/10887
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Boolean programming (90C09)
Related Items (36)
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ A branch and bound algorithm for the maximum diversity problem ⋮ Iterated tabu search for the maximum diversity problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ GRASP and path relinking for the equitable dispersion problem ⋮ Tabu search and GRASP for the maximum diversity problem ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ A hybrid three-phase approach for the Max-Mean dispersion problem ⋮ A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem ⋮ Hybrid heuristics for the maximum diversity problem ⋮ Approximation algorithms for maximum dispersion ⋮ Subset selection from large datasets for kriging modeling ⋮ An exact semidefinite programming approach for the max-mean dispersion problem ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ Lagrangian solution of maximum dispersion problems ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ A two-stage method for member selection of emergency medical service ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Memetic self-adaptive evolution strategies applied to the maximum diversity problem ⋮ Tabu search versus GRASP for the maximum diversity problem ⋮ Applications of the DM‐GRASP heuristic: a survey ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ Maximum diversity/similarity models with extension to part grouping ⋮ Heuristic algorithms for the maximum diversity problem ⋮ Iterated greedy for the maximum diversity problem ⋮ Measuring diversity. A review and an empirical analysis ⋮ The maximum diversity assortment selection problem ⋮ A heuristic approach for the max-min diversity problem based on max-clique ⋮ The equitable dispersion problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ GRASP and path relinking for the max-min diversity problem ⋮ A hybrid metaheuristic method for the maximum diversity problem
Cites Work
- Lexicographic bottleneck problems
- A GRASP for a difficult single machine scheduling problem
- Greedy randomized adaptive search procedures
- Semi-greedy heuristics: An empirical study
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computational aspects of the maximum diversity problem
