Publications of R. Corrêa
BACK TO COATI PUBLICATION INDEX
Publications of R. Corrêa
-
J-C. Bermond,
R. Correa,
and M-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Discrete Mathematics,
309(18):5574-5587,
September 2009.
Note: A preliminary version has been presented at CIAC06.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Correa,
F. Havet,
and J-S. Sereni.
About a Brooks-type theorem for improper colouring.
Australasian Journal of Combinatorics,
43:219--230,
2009.
[PDF
] [Abstract] [bibtex-entry]
-
O. Barrientos,
R. Correa,
P. Reyes,
and A. Valdebenito.
A Branch and Bound Method for Solving Integer Separable Concave Problems.
Comput. Optim. Appl.,
26(2):155--171,
2003.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Scheduling multiprocessor tasks with genetic algorithms.
IEEE Transactions on Parallel and Distributed Systems,
10(8):825-837,
August 1999.
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Integrating list heuristics in genetic algorithms for multiprocessor scheduling.
IEEE Transactions on Parallel and Distributed Systems,
10(8):825-837,
August 1999.
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and S. Porto.
Selected Algorithmic Techniques for Parallel Optimization.
In D. Du and P. Pardalos, editors,Handbook of Combinatorial Optimization,
volume 3,
pages 407-456.
Kluwer Academic Publisher, Boston (USA),
1998.
[bibtex-entry]
-
R. Corrêa and A. Ferreira.
Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework.
In A. Ferreira and P. Pardalos, editors,Solving Combinatorial Optimization Problems in Parallel,
volume 1054 of LNCS State-of-the-Art Surveys,
pages 171--200.
Springer-Verlag,
1996.
[bibtex-entry]
-
R. Corrêa and A. Ferreira.
Modeling Parallel Branch-and-Bound for Asynchronous Implementations.
DIMACS series in Discrete Mathematics and Theoretical Computer Science,
22:45--56,
1995.
[bibtex-entry]
-
R. Corrêa and A. Ferreira.
A Distributed Implementation of Asynchronous Parallel Branch and Bound.
In A. Ferreira and J. Rolim, editors,Solving Irregular Problems in Parallel: State of the Art,
pages 157--176.
Kluwer Academic Publisher, Boston (USA),
1995.
[bibtex-entry]
-
R. Corrêa and A. Ferreira.
On the effectivenes of parallel branch and bound.
Parallel Processing Letters,
5(3):375--386,
1995.
[bibtex-entry]
-
J-C. Bermond,
R. Corrêa,
and M-L. Yu.
Gathering algorithms on paths under interference constraints.
In 6th Conference on Algorithms and Complexity,
volume 3998 of Lecture Notes in Computer Science,
Roma, Italy,
pages 115--126,
May 2006.
[WWW
] [PDF
] [bibtex-entry]
-
R. Corrêa and A. Ferreira.
A polynomial-time branching procedure for the multiprocessor scheduling problem.
In Proceedings of Europar'99,
volume 1685 of Lecture Notes in Computer Science,
Toulouse (F),
pages 272-279,
August 1999.
Springer Verlag.
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Integrating list heuristics in genetic algorithms for multiprocessor scheduling.
In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing -- SPDP'96,
New Orleans (USA),
pages 462--469,
October 1996.
IEEE CS Press.
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Algorithmes génétiques ``intelligents'' pour l'ordonnancement de tâches.
In Proceedings of the 8ème Rencontres du Parallélisme,
Bordeaux,
May 1996.
[bibtex-entry]
-
J-C. Bermond,
R. Correa,
and M-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Technical report inria-00168162,
HAL,
August 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Correa,
F. Havet,
and J.-S. Sereni.
About a Brooks-type theorem for improper colouring.
Research Report RR-6432,
INRIA,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:43 2022
