Iterated tabu search for the maximum diversity problem

DOI10.1016/j.amc.2006.11.090zbMath1122.65362OpenAlexW1968062615MaRDI QIDQ2381330

Gintaras Palubeckis

Publication date: 17 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.090

zbMATH Keywords

integer programmingnumerical examplescombinatorial optimizationmetaheuristicstabu searchMaximum diversity problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (23)

A review on algorithms for maximum clique problems ⋮ An improved exact algorithm for least-squares unidimensional scaling ⋮ A branch and bound algorithm for the maximum diversity problem ⋮ A tabu search based memetic algorithm for the Max-Mean dispersion problem ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Heuristics for the capacitated dispersion problem ⋮ A branch-and-bound algorithm for the single-row equidistant facility layout problem ⋮ Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification ⋮ A simple and effective algorithm for the MaxMin diversity problem ⋮ Memetic self-adaptive evolution strategies applied to the maximum diversity problem ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ Iterated greedy for the maximum diversity problem ⋮ Measuring diversity. A review and an empirical analysis ⋮ Construction and improvement algorithms for dispersion problems ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ Maximization problems of balancing submodular relevance and supermodular diversity ⋮ Finding optimal solutions to several gray pattern instances ⋮ A hybrid metaheuristic method for the maximum diversity problem

Uses Software

• IT-CEMOP

Cites Work

• Good solutions to discrete noxious location problems via metaheuristics
• Tabu search and GRASP for the maximum diversity problem
• IT-CEMOP: an iterative co-evolutionary algorithm for multiobjective optimization problem with nonlinear constraints
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• Computational aspects of the maximum diversity problem
• Approximation algorithms for maximum dispersion
• New facets and a branch-and-cut algorithm for the weighted clique problem.
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• An application of tabu search heuristic for the maximum edge-weighted subgraph problem
• Obtaining test problems via Internet
• Mean square error criteria to multiresponse process optimization by a new genetic algorithm
• Approximation Algorithms for Dispersion Problems
• Tabu Search—Part I
• Heuristic and Special Case Algorithms for Dispersion Problems
• Heuristic algorithms for the maximum diversity problem
• The dense \(k\)-subgraph problem
• A Lagrangian relaxation approach to the edge-weighted clique problem

This page was built for publication: Iterated tabu search for the maximum diversity problem