In this work we introduce and study the strong generalized minimum label spanning tree
(GMLST), a novel optimization problem defined on edge‐labeled graphs. Given a label set …

An edge-labeled graph (ELG) is a graph in which each edge has a label associated. Given
G, an ELG, the minimum labeling spanning tree problem (MLSTP) is an NP-hard problem …

Given an undirected and edge-colored graph G, a rainbow component of G is a subgraph of
G having all the edges with different colors. The Rainbow Spanning Forest Problem consists …

We present exact mixed integer programming approaches including branch‐and‐cut and
branch‐and‐cut‐and‐price for the minimum label spanning tree problem as well as a variant …

Given a connected undirected graph G whose edges are labeled, the minimum labeling
spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of …

Given a graph G=(V, E, L) G=(V, E, L) and a coloring function ℓ: E → L ℓ: E→ L, that assigns
a color to each edge of G from a finite color set L, the rainbow spanning forest problem …

A rainbow spanning forest (say RF) of a given connected, undirected and edge-colored
graph (G) is a spanning forest of a set of rainbow components, where a rainbow component …

Given a connected, undirected and edge-colored graph, the rainbow spanning forest (RSF)
problem aims to find a rainbow spanning forest with the minimum number of rainbow trees …

In the k-labeled Spanning Forest Problem (kLSF), given a graph G with a label (color)
assigned to each edge, and an integer positive value k max we look for the minimum …

This paper proposes a novel evolutionary algorithm to handle the colorful traveling
salesman problem. The proposed evolutionary algorithm is a three-phase algorithm and …