A branch and bound algorithm for the maximum diversity problem

DOI10.1016/j.ejor.2008.12.023zbMath1188.90179OpenAlexW1991805259MaRDI QIDQ2379521

Micael Gallego, Rafael Martí, Abraham Duarte

Publication date: 19 March 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.023

zbMATH Keywords

integer programmingbranch and boundmaximum diversity problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

A review on algorithms for maximum clique problems, Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem, Branch and bound for the cutwidth minimization problem, A tabu search based memetic algorithm for the Max-Mean dispersion problem, On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study, An exact semidefinite programming approach for the max-mean dispersion problem, 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, Maximizing single attribute diversity in group selection, Heuristics for the capacitated dispersion problem, An exact cutting plane method for the Euclidean max-sum diversity problem, Formulations and valid inequalities for the capacitated dispersion problem, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, 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, Heuristic solution approaches for the maximum minsum dispersion problem, A Davidson college multi-objective assignment problem: a case study, Iterated greedy for the maximum diversity problem, Measuring diversity. A review and an empirical analysis, Construction and improvement algorithms for dispersion problems, The maximum diversity assortment selection problem, A note on computational approaches for the antibandwidth problem, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, A maximum edge-weight clique extraction algorithm based on branch-and-bound, A hybrid metaheuristic method for the maximum diversity problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Tabu search and GRASP for the maximum diversity problem
• Computational aspects of the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Hybrid heuristics for the maximum diversity problem
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Heuristic algorithms for the maximum diversity problem
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Experimental and Efficient Algorithms