Philippe Michelon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Philippe Michelon has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jacques A. Ferland
University of Montreal
4 shared publications - Marius Posta
Université de Montréal
2 shared publications - Andréa Carneiro Linhares
Universidade Federal do Ceará Sobral Ceará Brazil
1 shared publication - Carlos Martinhon
Fluminense Fed Univ, Inst Computat, BR-24210240 Niteroi, RJ, Brazil
1 shared publication - Edcarllos Santos
Instituto de Computação Universidade Federal Fluminense Niterói Brazil
1 shared publication - Israel Mendonça
Université d'Avignon LIA EA 4128 France
1 shared publication
Latest Publications
- Open Access
Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament
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 representing voting sessions of the European Parliament (EP). We first process some data collected by the VoteWatch Europe Website for the whole 7 th term (2009-2014), by considering voting similarities between Members of the EP to define weighted signed links. We then apply a selection of community detection algorithms, designed to process only positive links, to these data. We also apply Parallel Iterative Local Search (Parallel ILS), an algorithm recently proposed to identify balanced partitions in signed networks. Our results show that, contrary to the conclusions of a previous study focusing on other data, the partitions detected by ignoring or considering the negative links are indeed remarkably different for these networks. The relevance of negative links for graph partitioning therefore is an open question which should be further explored.
Open AccessRelevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament
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 representing voting sessions of the European Parliament (EP). We first process some data collected by the VoteWatch Europe Website for the whole 7 th term (2009-2014), by considering voting similarities between Members of the EP to define weighted signed links. We then apply a selection of community detection algorithms, designed to process only positive links, to these data. We also apply Parallel Iterative Local Search (Parallel ILS), an algorithm recently proposed to identify balanced partitions in signed networks. Our results show that, contrary to the conclusions of a previous study focusing on other data, the partitions detected by ignoring or considering the negative links are indeed remarkably different for these networks. The relevance of negative links for graph partitioning therefore is an open question which should be further explored.
- 1 May 2015
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 3 (2) , 79-110
A linear formulation with O(n^2) variables for quadratic assignment problems with Manhattan distance matrices
- 1 May 2015
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 3 (2) , 79-110
A linear formulation with O(n^2) variables for quadratic assignment problems with Manhattan distance matrices
- Open Access
A Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow
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 commodities from its origin to its destination by signing a network through selecting arcs, with an objective of minimizing the sum of the fixed costs of the selected arcs plus the sum of variable costs associated to the flows on each arc. Besides that, since the FCNDP-UOF is a bi-level problem, each commodity has to be transported through a shortest path, concerning the edges length, in the built network. The proposed algorithm generate a initial solution using a variable fixing heuristic. Then a local branching strategy is applied to improve the quality of the solution. At last, an efficient perturbation strategy is presented to perform cycle-based moves to explore different parts of the solution space. Computational experiments shows that the proposed solution method consistently produces high-quality solutions in reasonable computational times.
Open AccessA Variable Fixing Heuristic with Local Branching for the Fixed Charge Uncapacitated Network Design Problem with User-optimal Flow
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 commodities from its origin to its destination by signing a network through selecting arcs, with an objective of minimizing the sum of the fixed costs of the selected arcs plus the sum of variable costs associated to the flows on each arc. Besides that, since the FCNDP-UOF is a bi-level problem, each commodity has to be transported through a shortest path, concerning the edges length, in the built network. The proposed algorithm generate a initial solution using a variable fixing heuristic. Then a local branching strategy is applied to improve the quality of the solution. At last, an efficient perturbation strategy is presented to perform cycle-based moves to explore different parts of the solution space. Computational experiments shows that the proposed solution method consistently produces high-quality solutions in reasonable computational times.
- 9 February 2014
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 6 (3) , 199-231
An exact cooperative method for the uncapacitated facility location problem
- 9 February 2014
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 6 (3) , 199-231
An exact cooperative method for the uncapacitated facility location problem
- 13 September 2011
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 52 (3) , 629-644
An exact method with variable fixing for solving the generalized assignment problem
- 13 September 2011
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 52 (3) , 629-644
An exact method with variable fixing for solving the generalized assignment problem
- 31 May 2011
- Published by Elsevier in Discrete Optimization
- Vol. 8 (2) , 215-228
Generalized resolution search
- 31 May 2011
- Published by Elsevier in Discrete Optimization
- Vol. 8 (2) , 215-228
Generalized resolution search
- Open Access
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
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 addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.
Open AccessSolving the Frequency Assignment Problem by Site Availability and Constraint Programming
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 addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of Constraint Programming and integrate the site availability concept. Numerical simulations conducted on scenarios provided by CELAR are very promising.
- Open Access
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
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 large?scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
Open AccessSolving the 0-1 Multidimensional Knapsack Problem with Resolution Search
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 large?scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
- 1 June 1988
- Published by JSTOR in Journal of the Operational Research Society
- Vol. 39 (6) , 577
The Vehicle Scheduling Problem with Multiple Vehicle Types
- 1 June 1988
- Published by JSTOR in Journal of the Operational Research Society
- Vol. 39 (6) , 577
The Vehicle Scheduling Problem with Multiple Vehicle Types