Population-based iterated greedy algorithm for the S-labeling problem

DOI10.1016/j.cor.2023.106224OpenAlexW4328100113MaRDI QIDQ6164608

Manuel Lozano, Eduardo Rodriguez-Tello

Publication date: 4 July 2023

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

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

zbMATH Keywords

combinatorial optimizationgraph labelingantibandwidth problemiterated greedy metaheuristicS-labeling problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimization by Simulated Annealing
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
• Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
• Tabu search for the cyclic bandwidth problem
• Variable neighborhood search for the vertex separation problem
• Algorithmic complexity of proper labeling problems
• A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs
• Adaptive memory programming for matrix bandwidth minimization
• Memetic algorithm for the antibandwidth maximization problem
• A new hybrid evolutionary algorithm for the MinLA problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A random-key genetic algorithm for the generalized traveling salesman problem
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
• 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
• The NP-completeness of the bandwidth minimization problem
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• GRASP and path relinking for the matrix bandwidth minimization.
• Alternative evaluation functions for the cyclic bandwidth sum problem
• The \(S\)-\textsc{labeling} problem: an algorithmic tour
• An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
• Scatter search for the cutwidth minimization problem
• On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application
• Tree-width, path-width, and cutwidth
• Algorithmic expedients for the \(S\)-labeling problem
• A hybrid differential evolution algorithm with column generation for resource constrained job scheduling
• Multistart search for the cyclic cutwidth minimization problem
• A note on computational approaches for the antibandwidth problem
• A general variable neighborhood search for the cyclic antibandwidth problem
• Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Iterated greedy for the maximum diversity problem
• Particle swarm optimization and hill climbing for the bandwidth minimization problem
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• An improved simulated annealing algorithm for bandwidth minimization
• TTT plots: a perl program to create time-to-target plots
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• An artificial bee colony algorithm for the maximally diverse grouping problem
• Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
• Algorithmic Aspects of the S-Labeling Problem
• A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem
• On the S-Labeling problem
• On Maximum Differential Graph Coloring
• GRASP with path relinking heuristics for the antibandwidth problem
• On Some Variants of the Bandwidth Minimization Problem
• Packing of (0, 1)-matrices
• Handbook of Heuristics
• A Separator Theorem for Planar Graphs
• Parallel variable neighbourhood search strategies for the cutwidth minimization problem
• A GRASP for coloring sparse graphs

This page was built for publication: Population-based iterated greedy algorithm for the S-labeling problem