Population-based iterated greedy algorithm for the S-labeling problem (Q6164608)

scientific article; zbMATH DE number 7706736

Language	Label	Description	Also known as
English	Population-based iterated greedy algorithm for the S-labeling problem	scientific article; zbMATH DE number 7706736

Statements

instance of

scholarly article

0 references

title

Population-based iterated greedy algorithm for the S-labeling problem (English)

0 references

DOI

10.1016/j.cor.2023.106224

0 references

author

Manuel Lozano

0 references

Eduardo Rodriguez-Tello

0 references

published in

Computers \& Operations Research

0 references

publication date

4 July 2023

0 references

Mathematics Subject Classification ID

0 references

0 references

iterated greedy metaheuristic

0 references

S-labeling problem

0 references

antibandwidth problem

0 references

graph labeling

0 references

combinatorial optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2023.106224

0 references

OpenAlex ID

W4328100113

0 references

cites work

TTT plots: a perl program to create time-to-target plots

0 references

Memetic algorithm for the antibandwidth maximization problem

0 references

Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem

0 references

Adaptive memory programming for matrix bandwidth minimization

0 references

A general variable neighborhood search for the cyclic antibandwidth problem

0 references

Multistart search for the cyclic cutwidth minimization problem

0 references

Handbook of Heuristics

0 references

Algorithmic complexity of proper labeling problems

0 references

Variable neighborhood search for the vertex separation problem

0 references

GRASP with path relinking heuristics for the antibandwidth problem

0 references

Parallel variable neighbourhood search strategies for the cutwidth minimization problem

0 references

An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

0 references

Algorithmic Aspects of the S-Labeling Problem

0 references

The \(S\)-\textsc{labeling} problem: an algorithmic tour

0 references

On the S-Labeling problem

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

Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

0 references

On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application

0 references

On Maximum Differential Graph Coloring

0 references

A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

0 references

Optimization by Simulated Annealing

0 references

Tree-width, path-width, and cutwidth

0 references

A GRASP for coloring sparse graphs

0 references

On Some Variants of the Bandwidth Minimization Problem

0 references

Particle swarm optimization and hill climbing for the bandwidth minimization problem

0 references

A Separator Theorem for Planar Graphs

0 references

Iterated greedy for the maximum diversity problem

0 references

A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows

0 references

A hybrid differential evolution algorithm with column generation for resource constrained job scheduling

0 references

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

0 references

Scatter search for the cutwidth minimization problem

0 references

The NP-completeness of the bandwidth minimization problem

0 references

A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem

0 references

GRASP and path relinking for the matrix bandwidth minimization.

0 references

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

0 references

An artificial bee colony algorithm for the maximally diverse grouping problem

0 references

An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem

0 references

An improved simulated annealing algorithm for bandwidth minimization

0 references

Alternative evaluation functions for the cyclic bandwidth sum problem

0 references

Tabu search for the cyclic bandwidth problem

0 references

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

0 references

Combining intensification and diversification strategies in VNS. An application to the vertex separation problem

0 references

A new hybrid evolutionary algorithm for the MinLA problem

0 references

Algorithmic expedients for the \(S\)-labeling problem

0 references

A note on computational approaches for the antibandwidth problem

0 references

A random-key genetic algorithm for the generalized traveling salesman problem

0 references

Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces

0 references

A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs

0 references

Packing of (0, 1)-matrices

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6164608