A branch and bound algorithm for the maximum diversity problem

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

Rafael Martí, Abraham Duarte, Micael Gallego

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 programming; branch and bound; maximum diversity problem

Mathematics Subject Classification ID

90C10: Integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

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, Heuristic solution approaches for the maximum minsum dispersion problem, Construction and improvement algorithms for dispersion problems, A Davidson college multi-objective assignment problem: a case study, Iterated greedy for the maximum diversity problem, A hybrid metaheuristic method for the maximum diversity 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, Memetic self-adaptive evolution strategies applied to the maximum diversity problem, A review on algorithms for maximum clique problems

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