Iterated greedy for the maximum diversity problem

DOI10.1016/J.EJOR.2011.04.018MaRDI QIDQ2275623zbMATH OpenOpenAlexDBLPWikidataFDO

Authors M. Lozano, Daniel Molina, C. García-Martínez

Publication date 9 August 2011

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

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

zbMATH Keywords

acceptance criterioniterated greedylocal searchmaximum diversity problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Iterated tabu search for the maximum diversity problem
• Heuristic algorithms for the maximum diversity problem
• Computational aspects of the maximum diversity problem
• A hybrid metaheuristic method for the maximum diversity problem
• A branch and bound algorithm for the maximum diversity problem

Cites work

• A branch and bound algorithm for the maximum diversity problem
• A method for member selection of cross-functional teams using the individual and collaborative performances
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• An application of tabu search heuristic for the maximum edge-weighted subgraph problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Black box scatter search for general classes of binary optimization problems
• Computational aspects of the maximum diversity problem
• Experimental and Efficient Algorithms
• Good solutions to discrete noxious location problems via metaheuristics
• Heuristic algorithms for the maximum diversity problem
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 956851 (Why is no real title available?)
• Iterated greedy local search methods for unrelated parallel machine scheduling
• Iterated tabu search for the maximum diversity problem
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
• Note: A local-search heuristic for large set-covering problems
• Obtaining test problems via Internet
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Shifting representation search for hybrid flexible flowline problems
• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• Tabu search and GRASP for the maximum diversity problem
• Tabu search versus GRASP for the maximum diversity problem
• The equitable dispersion problem
• Variable neighborhood search for the heaviest \(k\)-subgraph

Cited in

(21)

• Computational aspects of the maximum diversity problem
• The Boolean quadratic programming problem with generalized upper bound constraints
• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• The maximum diversity assortment selection problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Optimizing node infiltrations in complex networks by a local search based heuristic
• A hybrid metaheuristic method for the maximum diversity problem
• Mathematical optimization ideas for biodiversity conservation
• A branch and bound algorithm for the maximum diversity problem
• Iterated tabu search for the maximum diversity problem
• Memetic self-adaptive evolution strategies applied to the maximum diversity problem
• A review on algorithms for maximum clique problems
• 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
• Iterated greedy algorithms for the maximal covering location problem
• Iterated maxima search for the maximally diverse grouping problem
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Heuristic algorithms for the maximum diversity problem
• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• The stochastic pseudo-star degree centrality problem
• Population-based iterated greedy algorithm for the S-labeling problem

Describes a project that uses

Uses Software

• DIMACS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275623)