Dr Pierre Chardaire
| Job Title | Contact | Location |
|---|---|---|
| Senior Lecturer |
P dot Chardaire at uea dot ac dot uk
Tel: +44 (0)1603 59 2647 |
Sciences 2.30 |
Career
Pierre started his carreer in 1983 with Thomson-Answare where he spent a few months designing a P-code interpreter in the PAL8 assembly language. In 1984 he joined the France-Telecom Labs (CNET) as a Network Planning Researcher. On his arrival, he worked with the data network planning group where he designed computer tools that were used by operational departments and France Telecom consultants for public and private networks. Pierre was awarded a CNET innovative software prize twice. In 1991, he became a member of a new group in charge of developing optimization methods and algorithms for other groups. In 1994, he obtained a position of Expert.
Pierre's first contact with UEA was in 1993 when he spent a six months sabbatical working on a research contract for France-Telecom in the Mathematical Algorithms Group of the School of Information Systems.
At the end of 1994 he joined the University of East Anglia as a Lecturer in Computer Science. In 1999 he obtained a position of Reader. In 2010 he transferred to a Senior Lecturer position.
Academic Background
Pierre graduated from the Ecole Nationale Superieure d'Informatique et de Mathematiques Appliquees de Grenoble in 1983. In 1999 he was awarded a Ph.D. by the University of East Anglia.
Website
Key Research Interests
Pierre Chardaire is part of the Optimisation and Metaheuristics Group
- Combinatorial Optimization
- Linear and Integer Programming
- Game Theory
- Network Programming
Selected Publications:
Chardaire, P., Barake, M., and McKeown, G. P., A PROBE-Based Heuristic for Graph Partitioning. IEEE Transactions on Computers, Volume 56, Number 12, Page(s) 1701-1720, 2007.
Chardaire, P., McKeown, G. P., Verity-Harrison, S. A. and Richardson, S. B., Solving a Time-Space Formulation for the Convoy Movement Problem. Operations Research, Volume 53, Number 2, Page(s) 219-230, 2005.
Chardaire, P. and de Cogan, D., Distribution in TLM models for diffusion (Part II: multi-dimensional treatment). International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, Volume 16, Issue 6, Page(s) 509-534, 2003.
Chardaire, P. and de Cogan, D., Distribution in TLM models for diffusion (Part I: one-dimensional treatment). International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, Volume 15, Issue 3, Page(s) 317-327, 2002.
Chardaire, P. and Lisser, A., Simplex and interior point specialized algorithms for solving non oriented multicommodity flow problems. Operations Research, Volume 50, Number 2, Page(s) 260-276, 2002.
List all publications by Dr Pierre Chardaire (Eprints)
Past Research Projects and Grants
Article
Chardaire, P., Barake, M. and McKeown, G. P. (2007) A PROBE-Based Heuristic for Graph Partitioning. IEEE Transactions on Computers, 56 (12). pp. 1701-1720. ISSN 0018-9340
Chardaire, P., McKeown, G. P., Verity-Harrison, S. A. and Richardson, S. B. (2005) Solving a Time-Space Network Formulation for the Convoy Movement Problem. Operations Research, 53 (2). pp. 219-230. ISSN 0030-364X
Chardaire, P. and de Cogan, D. (2003) Distribution in TLM models for diffusion (Part II: multi-dimensional treatment). International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 16 (6). pp. 509-534. ISSN 1099-1204
Chardaire, P. and Lisser, A. (2002) Simplex and interior point specialized algorithms for solving non oriented multicommodity flow problems. Operations Research, 50 (2). pp. 260-276. ISSN 0030-364X
Chardaire, P. and de Cogan, D. (2002) Distribution in TLM models for diffusion (Part 1: one-dimensional treatment). International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 15 (3). pp. 317-327. ISSN 0894-3370
Chardaire, P. (2001) The core and nucleolus of games: A note on a paper by Göthe-Lundgren et al. Mathematical Programming, 90 (1). pp. 147-151. ISSN 0025-5610
Bangham, JA, Chardaire, P, Pye, CJ and Ling, PD (1996) Multiscale nonlinear decomposition: The sieve decomposition theorem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18 (5). pp. 529-539. ISSN 0162-8828
Book Section
Barake, M., Chardaire, P. and McKeown, G. P. (2003) The PROBE Metaheuristic and its Application to the Multiconstraint Knapsack Problem. In: METAHEURISTICS: Computer Decision-Making. Applied Optimization, 86 . Kluwer Academic Publishers, pp. 19-36. ISBN 978-1-4020-7653-4
Chardaire, Pierre and Lisser, Abdel (2002) Minimum-Cost Multicommodity Flow. In: Handbook of Applied Optimization. Oxford University Press, pp. 404-421. ISBN 978-0195125948
Chardaire, P. and Lisser, A. (2001) Nonoriented mulitcommodity flow problems. In: Encyclopedia of Optimization. Kluwer Academic Publishers, pp. 97-100.
Chardaire, Pierre, McKeown, Geoff P. and Maki, Jameel A. (2001) Application of GRASP to the multiconstraint knapsack problem. In: Applications of Evolutionary Computing. Lecture Notes in Computer Science, 2037 . Springer-Verlag, pp. 30-39. ISBN 978-3-540-41920-4
Chardaire, P. (1999) Hierarchichal two level location problems. In: Telecommunication network planning. Kluwer Academic Publishers, pp. 33-54. ISBN 978-0-7923-8397-0
Conference or Workshop Item
Chardaire, P. and McKeown, G. P. (2004) PROBE: a Metaheuristic for Hybridization. In: Design and Evaluation of Advanced Hybrid Meta-Heuristics, 4th EU/ME Workshop, 3-4 November 2004, Nottingham, UK.
Chardaire, P., McKeown, G. P. and Maki, J. A. (2004) Hybridizing GRASP, PROBE and Path Relinking. In: Workshop on Hybrid Metaheuristics, ECAI 2004, 22-23 August 2004, Valencia, Spain.
Rayward-Smith, VJ, Chardaire, P, Kapsalis, A, Mann, JW and Smith, GD (1995) Applications of Genetic Algorithms in Telecommunications. In: Int. Workshop on Applications of Neural Networks to Telecommunications.
Chardaire, P, Bangham, JA, Pye, CJ and Wu, DQ (1994) Properties of multiscale morphological filters namely the morphology decomposition theorem. In: SPIE Nonlinear signal processing.
Key Responsibilities
Disability Liaison
Visiting Students Coordinator
