Sciweavers

NETWORKS
2010
13 years 2 months ago
The regenerator location problem
Si Chen, Ivana Ljubic, S. Raghavan
NETWORKS
2010
13 years 2 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...