Computational aspects of the maximum diversity problem
From MaRDI portal
Publication:1360111
DOI10.1016/0167-6377(96)00025-9zbMATH Open0873.90070OpenAlexW2164719474MaRDI QIDQ1360111FDOQ1360111
Authors: Jay B. Ghosh 
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
Recommendations
Quadratic programming (90C20) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)
Cites Work
- Title not available (Why is that?)
- Greedy randomized adaptive search procedures
- Lexicographic bottleneck problems
- A GRASP for a difficult single machine scheduling problem
- Title not available (Why is that?)
- Semi-greedy heuristics: An empirical study
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Title not available (Why is that?)
Cited In (40)
- Iterated greedy for the maximum diversity problem
- A branch and bound algorithm for the maximum diversity problem
- Approximation algorithms for maximum dispersion
- An exact semidefinite programming approach for the max-mean dispersion problem
- Solving huge size instances of the optimal diversity management problem
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS
- Iterated tabu search for the maximum diversity problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- Different formulations of the gray pattern problem and their optimal solutions
- Applications of the DM‐GRASP heuristic: a survey
- A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem
- Hybrid heuristics for the maximum diversity problem
- Measuring diversity. A review and an empirical analysis
- Heuristic algorithms for the maximum diversity problem
- A two-stage method for member selection of emergency medical service
- An integer programming approach for solving the \(p\)-dispersion problem
- The maximum diversity assortment selection problem
- GRASP and path relinking for the equitable dispersion problem
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- The equitable dispersion problem
- A review on discrete diversity and dispersion maximization from an OR perspective
- Heuristic solution approaches for the maximum minsum dispersion problem
- Tabu search and GRASP for the maximum diversity problem
- Formulations and valid inequalities for the capacitated dispersion problem
- A simple and effective algorithm for the MaxMin diversity problem
- A hybrid three-phase approach for the Max-Mean dispersion problem
- A heuristic approach for the max-min diversity problem based on max-clique
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- GRASP and path relinking for the max-min diversity problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- Maximizing single attribute diversity in group selection
- Tabu search versus GRASP for the maximum diversity problem
- The combinatorics of hidden diversity
- Lagrangian solution of maximum dispersion problems
- Maximum diversity/similarity models with extension to part grouping
- A hybrid metaheuristic method for the maximum diversity problem
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem
- Subset selection from large datasets for kriging modeling
This page was built for publication: Computational aspects of the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360111)
