18 citations · 34 across the 5 of their papers we have counts for
6 papers
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…
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament
Israel Mendonça, Rosa Figueiredo, Vincent Labatut +1
In this paper, we want to study the informative value of negative links in signed complex networks. For this purpose, we extract and analyze a collection of signed networks represe…
A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow
Pedro Henrique González, Luidi Simonetti, Philippe Michelon +2
This paper presents an iterated local search for the fixed-charge uncapacitated network design problem with user-optimal flow (FCNDP-UOF), which concerns routing multiple commoditi…
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun +2
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its diffic…
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
Andrea Carneiro Linhares, Juan-Manuel Torres-Moreno, Peter Peinl +1
The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addre…
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…