Carousel greedy: a generalized greedy algorithm with applications in optimization
type: Item
instance of: scholarly article
title: Carousel greedy: a generalized greedy algorithm with applications in optimization
zbMATH Open document ID: 1458.90643
author: C. Cerrone
author: Raffaele Cerulli
author: Bruce Golden
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6901452
zbMATH Keywords: metaheuristics
zbMATH Keywords: greedy algorithm
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: minimum label spanning tree
zbMATH Keywords: vertex cover
zbMATH Keywords: independent set
zbMATH Keywords: iterated greedy
zbMATH Keywords: carousel greedy
describes a project that uses: DIMACS
describes a project that uses: BHOSLIB
MaRDI profile type: Publication
full work available at URL: j.cor.2017.03.016
OpenAlex ID: W2604863078
cites work: A mixed integer linear formulation for the minimum label spanning tree problem
cites work: OMEGA one multi ethnic genetic approach
cites work: The minimum labeling spanning trees
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
cites work: Solving the minimum labelling spanning tree problem using hybrid local search
cites work: Q3339960
cites work: The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems
cites work: Parallel concepts in graph theory
cites work: Efficient bounds for the stable set, vertex cover and set packing problems
cites work: Q4714131
cites work: Reducibility among Combinatorial Problems
cites work: On the minimum label spanning tree problem
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: An ant colony optimization algorithm for the minimum weight vertex cover problem
cites work: Looking ahead with the pilot method
cites work: Multi-start iterated tabu search for the minimum weight vertex cover problem
DOI: 10.1016/J.COR.2017.03.016
description: scientific article; zbMATH DE number 6901452