Publications scientifiques : GERAD

jan. 2005

An efficient heuristic to dimension large scale hybrid optoelectronic IP/MPLS based networks

François Cartier, Brunilde Sansò et André Girard

Computers & Operations Research, 2005 référence BibTeX

jan. 2005

A time-consistent open-loop Stackelberg equilibrium of shelf-space allocation

Automatica, 41(6), 971–982, 2005 référence BibTeX

jan. 2005

Analysis of global k-means an incremental heuristic for minimum sum-of-square clustering

Pierre Hansen, Eric W.T. Ngai, Bernard K.-S. Cheung et Nenad Mladenović

Journal of Classification, 22, 287–310, 2005 référence BibTeX

jan. 2005

Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity

Slim Belhaiza, Nair Maria Maia de Abreu, Pierre Hansen et Carla Silva Oliveira

Edited by D. Avis, A. Hertz, O. Marcotte, Graph Theory and Combinatorial Optimization, Kluwer Academic Publishers, 1–16, 2005 référence BibTeX

jan. 2005

Optimal prices and trade-in rebates for durable, remanufacturable products

Saibal Ray, Tamer Boyaci et Necati Aras

Manufacturing & Service Operations Management, 7, 208–228, 2005 référence BibTeX

jan. 2005

Energy and environment

Richard Loulou, Jean-Philippe Waaub et Georges Zaccour

jan. 2005

Quasi-Likelihood Estimation for Ornstein-Uhlenbeck Diffusion Observed at Random Time Points

Michel Adès, Jean-Pierre Dion et Brenda MacGibbon

Serdica Mathematical Journal, 31(4), 291–308, 2005 référence BibTeX

jan. 2005

Shortest path problems with resource constraints

. Desaulniers, J. Desrosiers, M.M. Solomon (eds.), Column Generation, Springer, New York, 33–65, 2005 référence BibTeX

jan. 2005

SIAM Journal on Control and Optimization, 44(1), 367–387, 2005 référence BibTeX

jan. 2005

What forms do interesting conjectures have in graph theory?

Pierre Hansen, Mustapha Aouchiche, Gilles Caporossi, Hadrien Mélot et Dragan Stevanovic

DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 69, 231–252, 2005 référence BibTeX