Irène Charon
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
Irène Charon has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Olivier Hudry
Ecole Nationale Supérieure des Télécommunications
3 shared publications - Georges Hébrail
TELECOM ParisTech, Partially Suported by ANR (MIDAS Project ANR-07-MDO-008)
1 shared publication - Olivier Hudry
Ecole Nationale Supérieure des Télécommunications, 46, rue Barrault, 75634 Paris Cedex 13, France
1 shared publication - Olivier Hudry
École Nationale Supérieure des Télécommunications (ENST), 46 rue Barrault 75634 Paris cedex 13
1 shared publication
Latest Publications
- 30 June 2010
- Published by Springer Nature in Order
- Vol. 28 (1) , 99-119
Maximum Distance Between Slater Orders and Copeland Orders of Tournaments
- 30 June 2010
- Published by Springer Nature in Order
- Vol. 28 (1) , 99-119
Maximum Distance Between Slater Orders and Copeland Orders of Tournaments
- 19 November 2009
- Published by Springer Nature in Annals of Operations Research
- Vol. 175 (1) , 107-158
An updated survey on the linear ordering problem for weighted or unweighted tournaments
- 19 November 2009
- Published by Springer Nature in Annals of Operations Research
- Vol. 175 (1) , 107-158
An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Open Access
- 1 January 2009
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 187 (187) , 5-6
Journée de 2007 de la Société francophone de classification. Avant-propos
De statistique, tant du point de vue théorique que des applications, dans un esprit d'ouverture interdisciplinaire »(voir le site de la SFC, à l'adresse http ://www.
- 1 January 2009
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 187 (187) , 5-6
Open AccessJournée de 2007 de la Société francophone de classification. Avant-propos
De statistique, tant du point de vue théorique que des applications, dans un esprit d'ouverture interdisciplinaire »(voir le site de la SFC, à l'adresse http ://www.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-35
Application of the "descent with mutations" metaheuristic to a clique partitioning problem
We study here the application of a metaheuristic, issued from the noising methods and that we call "descent with mutations", to a problem arising in the field of the aggregation of symmetric relations: the clique partitioning of a weighted graph. This local search metaheuristic, of which the design is very simple, is compared with another very efficient metaheuristic, which is a simulated annealing improved by the addition of some ingredients coming from the noising methods. These experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while, above all, it is much easier to design and to apply.
- 1 March 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 29-35
Application of the "descent with mutations" metaheuristic to a clique partitioning problem
We study here the application of a metaheuristic, issued from the noising methods and that we call "descent with mutations", to a problem arising in the field of the aggregation of symmetric relations: the clique partitioning of a weighted graph. This local search metaheuristic, of which the design is very simple, is compared with another very efficient metaheuristic, which is a simulated annealing improved by the addition of some ingredients coming from the noising methods. These experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while, above all, it is much easier to design and to apply.
- 1 October 2006
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (15) , 2097-2116
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- 1 October 2006
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (15) , 2097-2116
A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments