Pierre Chardaire

Learn More
In this paper, we consider a problem relevant to the telecommunications industry. In a two-level concentrator access network, each terminal has to be connected to a first-level concentrator, which in turn must be connected to a second-level concentrator. If no extra complicating constraints are taken into account, the problem, translated into the language(More)
A new heuristic algorithm, PROBE BA, based on the recently introduced metaheuristic paradigm PROBE (Population Reinforced Optimization Based Exploration) is proposed for solving the Graph Partitioning Problem. The “exploration” part of PROBE BA is implemented using the Differential-Greedy algorithm of Battiti and Bertossi and a modification of the Kernighan(More)