Publications scientifiques : GERAD

jan. 2003

Guaranteed cost control of a Markov jump linear uncertain system using a time-multiplied cost function

El-Kébir Boukas, Z.K. Liu et Fouad M. Al-Sunni

Journal of Optimization Theory and Applications, 116(1), 183–204, 2003 référence BibTeX

jan. 2003

Chemical trees enumeration algorithms

Roberto Aringhieri, Pierre Hansen et Federico Malucelli

4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies , 1, 67–83, 2003 référence BibTeX

jan. 2003

Markovian discrete-time linear systems

El-Kébir Boukas et Z.K. Liu

jan. 2003

A lower-bound for the job insertion problem

T. Kis et Alain Hertz

Discrete Applied Mathematics, 128(38386), 395–419, 2003 référence BibTeX

jan. 2003

Randomized polynomial lattice tules for multivariate integration and simulation

Pierre L'Ecuyer et Christiane Lemieux

SIAM Journal on Scientific Computing, 24(5), 1768–1789, 2003 référence BibTeX

jan. 2003

Graphs with maximum connectivity index

Gilles Caporossi, Ivan Gutman, Pierre Hansen et L Pavlovic

Computational Biology and Chemistry, 27(1), 85–90, 2003 référence BibTeX

jan. 2003

Finding augmenting chains in extensions of claw-free graphs

Alain Hertz, Vadim Lozin et David Schindl

Information Processing Letters, 86(6), 311–316, 2003 référence BibTeX

jan. 2003

Scheduling and lot streaming in flowshops with no-wait in process

Nicholas G. Hall, Gilbert Laporte, E. Selvarajah et Chelliah Sriskandarajah

Journal of Scheduling, 6, 339–354, 2003 référence BibTeX

jan. 2003

Upper Bounds and Algorithms for the Maximum Cardinality Bin Packing Problem

Martine Labbé, Gilbert Laporte et Silvano Martello

European Journal of Operational Research, 149, 490–498, 2003 référence BibTeX

jan. 2003

On the Deng-Lin random number generators and related methods

Pierre L'Ecuyer et R Touzin

Statistics and Computing, 14(1), 5–9, 2003 référence BibTeX