Carousel greedy: a generalized greedy algorithm with applications in optimization

DOI10.1016/j.cor.2017.03.016zbMath1458.90643OpenAlexW2604863078MaRDI QIDQ1652355

Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.016

zbMATH Keywords

combinatorial optimizationmetaheuristicsgreedy algorithmindependent setvertex coveriterated greedycarousel greedyminimum label spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The rainbow Steiner tree problem, Two heuristics for the rainbow spanning forest problem, Grocery distribution plans in urban networks with street crossing penalties, The knapsack problem with forfeit sets, An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem, A two-stage solution approach for the directed rural postman problem with turn penalties, On the complexity of rainbow spanning forest problem, A hybrid metaheuristic for the minimum labeling spanning tree problem, The rainbow spanning forest problem

Uses Software

• BHOSLIB
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-start iterated tabu search for the minimum weight vertex cover problem
• An ant colony optimization algorithm for the minimum weight vertex cover problem
• Looking ahead with the pilot method
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A mixed integer linear formulation for the minimum label spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Efficient bounds for the stable set, vertex cover and set packing problems
• A probabilistic heuristic for a computationally difficult set covering problem
• Parallel concepts in graph theory
• The minimum labeling spanning trees
• On the minimum label spanning tree problem
• One-pass heuristics for large-scale unconstrained binary quadratic problems
• Greedy randomized adaptive search procedures
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
• Solving the minimum labelling spanning tree problem using hybrid local search
• A Greedy Heuristic for the Set-Covering Problem
• Reducibility among Combinatorial Problems
• OMEGA one multi ethnic genetic approach