A branch and bound algorithm for the maximum diversity problem
From MaRDI portal
Recommendations
- Heuristic algorithms for the maximum diversity problem
- A simple and effective algorithm for the MaxMin diversity problem
- Optimal results and tight bounds for the Maximum Diversity Problem
- Hybrid heuristics for the maximum diversity problem
- Computational aspects of the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- Iterated greedy for the maximum diversity problem
- Tabu search and GRASP for the maximum diversity problem
Cites work
- A unified framework for modeling and solving combinatorial optimization problems: a tutorial
- Computational aspects of the maximum diversity problem
- Experimental and Efficient Algorithms
- Heuristic algorithms for the maximum diversity problem
- Hybrid heuristics for the maximum diversity problem
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Iterated tabu search for the maximum diversity problem
- Tabu search and GRASP for the maximum diversity problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
Cited in
(34)- A review on discrete diversity and dispersion maximization from an OR perspective
- On solving simplified diversified top-\(k\,s\)-plex problem
- A hybrid metaheuristic method for the maximum diversity problem
- A simple and effective algorithm for the MaxMin diversity problem
- A Davidson college multi-objective assignment problem: a case study
- The maximum diversity assortment selection problem
- A tabu search based memetic algorithm for the Max-Mean dispersion problem
- Heuristic solution approaches for the maximum minsum dispersion problem
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
- An evaluation of exact methods for the multiple subset maximum cardinality selection problem
- A note on computational approaches for the antibandwidth problem
- Maximum diversity problem with squared Euclidean distance
- A maximum edge-weight clique extraction algorithm based on branch-and-bound
- Iterated greedy for the maximum diversity problem
- Measuring diversity. A review and an empirical analysis
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- \(t\)-linearization for the maximum diversity problem
- Optimal results and tight bounds for the Maximum Diversity Problem
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- Heuristics for the capacitated dispersion problem
- Tabu search and GRASP for the maximum diversity problem
- Formulations and valid inequalities for the capacitated dispersion problem
- Maximizing single attribute diversity in group selection
- Solving huge size instances of the optimal diversity management problem
- Maximum diversity/similarity models with extension to part grouping
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Construction and improvement algorithms for dispersion problems
- An exact semidefinite programming approach for the max-mean dispersion problem
- An exact cutting plane method for the Euclidean max-sum diversity problem
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- Branch and bound for the cutwidth minimization problem
- Hybrid heuristics for the maximum diversity problem
- Memetic self-adaptive evolution strategies applied to the maximum diversity problem
- A review on algorithms for maximum clique problems
This page was built for publication: A branch and bound algorithm for the maximum diversity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379521)
