Iterated greedy for the maximum diversity problem
From MaRDI portal
Publication:2275623
DOI10.1016/j.ejor.2011.04.018zbMath1218.90175OpenAlexW1975258147WikidataQ59342704 ScholiaQ59342704MaRDI QIDQ2275623
Manuel Lozano, Daniel Molina, Carlos 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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
A review on algorithms for maximum clique problems ⋮ An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem ⋮ The Boolean quadratic programming problem with generalized upper bound constraints ⋮ 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 ⋮ The stochastic pseudo-star degree centrality problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Memetic self-adaptive evolution strategies applied to the maximum diversity problem ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ 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 ⋮ The maximum diversity assortment selection problem ⋮ A hybrid metaheuristic method for the maximum diversity problem ⋮ Mathematical optimization ideas for biodiversity conservation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
- Good solutions to discrete noxious location problems via metaheuristics
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Tabu search and GRASP for the maximum diversity problem
- Solving the maximum edge weight clique problem via unconstrained quadratic programming
- Tabu search versus GRASP for the maximum diversity problem
- Black box scatter search for general classes of binary optimization problems
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- The equitable dispersion problem
- Variable neighborhood search for the heaviest \(k\)-subgraph
- 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
- A method for member selection of cross-functional teams using the individual and collaborative performances
- Computational aspects of the maximum diversity problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- Obtaining test problems via Internet
- A branch and bound algorithm for the maximum diversity problem
- Iterated tabu search for the maximum diversity problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Heuristic algorithms for the maximum diversity problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Note: A local-search heuristic for large set-covering problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Experimental and Efficient Algorithms
This page was built for publication: Iterated greedy for the maximum diversity problem
