Iterated greedy for the maximum diversity problem (Q2275623)

From MaRDI portal

Revision as of 01:43, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/eor/LozanoMG11, #quickstatements; #temporary_batch_1731543907597)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Iterated greedy for the maximum diversity problem	scientific article

Statements

scholarly article

0 references

Iterated greedy for the maximum diversity problem (English)

0 references

European Journal of Operational Research

0 references

publication date

9 August 2011

0 references

zbMATH Keywords

maximum diversity problem

0 references

iterated greedy

0 references

local search

0 references

acceptance criterion

0 references

0 references

0 references

Carlos García-Martínez

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2011.04.018

0 references

Solving the maximum edge weight clique problem via unconstrained quadratic programming

0 references

Experimental and Efficient Algorithms

0 references

Tabu search versus GRASP for the maximum diversity problem

0 references

Obtaining test problems via Internet

0 references

Variable neighborhood search for the heaviest \(k\)-subgraph

0 references

0 references

Tabu search and GRASP for the maximum diversity problem

0 references

Iterated greedy local search methods for unrelated parallel machine scheduling

0 references

A method for member selection of cross-functional teams using the individual and collaborative performances

0 references

A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

0 references

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

0 references

Computational aspects of the maximum diversity problem

0 references

Heuristic algorithms for the maximum diversity problem

0 references

Black box scatter search for general classes of binary optimization problems

0 references

Note: A local-search heuristic for large set-covering problems

0 references

Good solutions to discrete noxious location problems via metaheuristics

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates

0 references

An application of tabu search heuristic for the maximum edge-weighted subgraph problem

0 references

A branch and bound algorithm for the maximum diversity problem

0 references

Iterated tabu search for the maximum diversity problem

0 references

Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment

0 references

The equitable dispersion problem

0 references

0 references

A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

0 references

An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

0 references

Shifting representation search for hybrid flexible flowline problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2011.04.018

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/eor/LozanoMG11

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2275623

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2275623&oldid=37912122"