This paper addresses the jobshop and the flowshop scheduling problems with minimum and maximum time lags. To solve this kind of problems, we propose adaptations of Climbing Discre...
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
d Abstract) Jos´e Bacelar Almeida, Jorge Sousa Pinto, and Miguel Vila¸ca 1,2,3 Departamento de Inform´atica Universidade do Minho 4710-057 Braga, Portugal
Serial transcriptomics experiments investigate the dynamics of gene expression changes associated with a quantitative variable such as time or dosage. The statistical analysis of ...
This overview introduces the aim of the SMUC 2010 workshop, as well as the list of papers presented in the workshop. Categories and Subject Descriptors H.3 [Information Systems]: ...