The orderly colored longest path problem-a survey of applications and new algorithms
A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the
longest path in a graph whose edges are colored with a given number of colors, under the …
longest path in a graph whose edges are colored with a given number of colors, under the …
A hybrid metaheuristic for the minimum labeling spanning tree problem
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 …
G, an ELG, the minimum labeling spanning tree problem (MLSTP) is an NP-hard problem …
The rainbow spanning forest 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 …
G having all the edges with different colors. The Rainbow Spanning Forest Problem consists …
The rainbow steiner tree problem
Given an undirected and edge-colored graph with non-negative edge lengths, the aim of the
Rainbow Steiner Tree Problem (RSTP) is to find a minimum Steiner Tree that uses at most …
Rainbow Steiner Tree Problem (RSTP) is to find a minimum Steiner Tree that uses at most …
Constrained matching problems in bipartite graphs
We study the following generalization of maximum matchings in bipartite graphs: given a
bipartite graph such that each edge has a unique color cj, we are asked to find a maximum …
bipartite graph such that each edge has a unique color cj, we are asked to find a maximum …
[PDF][PDF] Combinatorial optimization in networks with shared risk link groups
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of
links of a network may fail simultaneously. The theory of survivable network design relies on …
links of a network may fail simultaneously. The theory of survivable network design relies on …
[PDF][PDF] Maximum flow problems and an NP-complete variant on edge-labeled graphs
The aim of this chapter is to present an overview of the main results for a well-known
optimization problem and an emerging optimization area, as well as introducing a new …
optimization problem and an emerging optimization area, as well as introducing a new …
On the complexity of rainbow spanning forest problem
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 color to each edge of G from a finite color set L, the rainbow spanning forest problem …
Two heuristics for 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 …
graph (G) is a spanning forest of a set of rainbow components, where a rainbow component …
A steady-state grou** genetic algorithm for the rainbow spanning forest problem
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 …
problem aims to find a rainbow spanning forest with the minimum number of rainbow trees …