18 citations · 34 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Solving the minimum labeling global cut problem by mathematical programming
Thiago Gouveia da Silva, Gilberto F. de Sousa Filho, Luiz Satoru Ochi +3
Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e \in E has a label l(e) associa…
cs.DM2009★ 2 cited
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
Sylvain Boussier, Michel Vasquez, Yannick Vimont +2
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove…