18 citations · 34 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2015★ 18 cited
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…
cs.DS2014★ 3 cited
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…