H  O  M  E    P  A  G  E  
PUBLICAÇÕES
     
| Livros e volumes especiais editados | Artigos submetidos para publicação | Artigos publicados |


n Livros e volumes especiais editados


TOPO
  1. C.C. Ribeiro, Abstracts of the IV ALIO/EURO Workshop on Applied Combinatorial Optimization, 2002.
  2. C.C. Ribeiro e P. Hansen, Essays and Surveys in Metaheuristics, Kluwer, 2002.
  3. C.C. Ribeiro e N. Maculan, Applications of Combinatorial Optimization, Annals of Operations Research 50, J.C. Baltzer, 1994.
  4. C.C. Ribeiro e P. Mahey, Progress in Mathematical Programming, Mathematical Programming 52, North-Holland, 1991.
  5. G. Laporte, S. Martello, M. Minoux e C.C. Ribeiro, Surveys in Combinatorial Optimization, Annals of Discrete Mathematics 31, North-Holland, 1987.

n Artigos submetidos para publicação e outros relatórios de pesquisa


TOPO
  1. C.C. Ribeiro, S. Urrutia e M. Arruda,“Número de pontos e chances de classificação em campeonatos classificatórios”, 2006. (pdf)
  2. C.C. Ribeiro e E. Sanlaville, “On the complexity of scheduling with elastic times”, 2002. (ps)
  3. R.F. Werneck e C.C. Ribeiro, “Sorting methods for small arrays”, 2000. (ps)

n Artigos publicados ou aceitos


TOPO
  1. R. Interian e C.C. Ribeiro, “An empirical investigation of network polarization”, Applied Mathematics and Computation, 2018, aceito. (pdf) 
  2. M.G.C. Resende e C.C. Ribeiro, “Greedy randomized adaptive search procedures: Advances and extensions”, Handbook of Metaheuristics (M. Gendreau e J.-Y. Potvin, editores), Springer, 2018, 3a edição, aceito. (pdf)
  3. B.Q. Pinto, C.C. Ribeiro, I. Rosseti e A. Plastino, “A biased random-key genetic algorithm for the maximum quasi-clique problem”, European Journal of Operational Research 271 (2018), 849-865. (pdf)
  4. A. Reyes e C.C.Ribeiro, “Extending time-to-target plots to multiple instances”, International Transactions in Operational Research 25 (2018), 1515-1536. (pdf)
  5. R. Interian, R. Rodríguez-Ramos, F. Valdés-Ravelo, A.R. Torres, C.C.Ribeiro e A. Conci, “Tumor growth modelling by cellular automata”, Mathematics and Mechanics of Complex Systems 5 (2017), 239-259. (pdf)
  6. R. Interian, J.M. Otero, C.C.Ribeiro e A.A. Montenegro, “Curve and surface fitting by implicit polynomials: Optimum degree finding and heuristic refinement”, Computer & Graphics 67 (2017), 14-23. (pdf)
  7. R. Interian e C.C.Ribeiro, “A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem”, International Transactions in Operational Research 24 (2017), 1307-1323. (pdf) 
  8. J.S. Brandão, T.F. Noronha, M.G.C. Resende e C.C.Ribeiro, “A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems”, International Transactions in Operational Research 24 (2017), 1061-1077. (pdf) 
  9. R.A. Melo e C.C.Ribeiro, “Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds”, International Journal of Production Research 55 (2017), 576-592. (pdf)
  10. A. Reyes e C. C. Ribeiro, “Extending time-to-target plots to multiple instances and targets: mttt-plots“, 12th Metaheuristics International Conference, paper #58, 2017. (pdf)
  11. R. Interian e C. C. Ribeiro, “A GRASP with restarts heuristic for the Steiner traveling salesman problem”, 12th Metaheuristics International Conference, paper #3, 2017. (pdf)
  12. A. Zudio, I.M. Coelho, P.E.D. Pinto e C.C. Ribeiro, “Algoritmo GRASP/VND para o problema clássico de empacotamento tridimensional e bidimensional”, Anais do XLIX Simpósio Brasileiro de Pesquisa Operacional, 1-12, Blumenau, 2017. (pdf)
  13. M. Tasca, A. Plastino, C.C. Ribeiro e B. Zadrozny, “An effective strategy for feature selection paths in high-dimensional datasets”, Journal of Information and Data Management 7 (2016), no. 2. (pdf) 
  14. M.G.C. Resende e C.C. Ribeiro, “Biased-random key genetic algorithms: An advanced tutorial”, Proceedings of the 2016 Genetic and Evolutionary Computation Conference - GECCO'16 Companion Volume, Association for Computing Machinery, 483-514, Denver, 2016. (pdf) 
  15. R.E.N. Moraes, C.C.Ribeiro e G.M. Ribeiro, “Exact formulations for the minimum interference problem in k-connected ad hoc wireless networks”, International Transactions in Operational Research 23 (2016), 1113-1139. (pdf)
  16. A. Reyes e C.C. Ribeiro, “Extending time-to-target plots to test sets with multiple problem instances: m-tttplots”, XVIII Latin-Iberoamerican Conference on Operations Research, Santiago, 2016. (pdf)
  17. J.S. Brandão, T.F. Noronha e C.C. Ribeiro, “A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks”, Journal of Global Optimization 65 (2016), 813-835. (pdf)
  18. T. Januário, S. Urrutia, C.C. Ribeiro e D. de Werra, “Edge coloring: A natural model for sports scheduling”, European Journal of Operational Research 254 (2016), 1-8. (pdf)
  19. L.M. Musmanno e C.C. Ribeiro, “Heuristics for the generalized median graph problem”, European Journal of Operational Research 254 (2016), 371-384. (pdf)
  20. R.A. Melo e C.C. Ribeiro, “Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking”, Computers and Industrial Engineering 85 (2015), 402-413. (pdf)
  21. J.S. Brandão, T.F. Noronha, M.G.C. Resende e C.C.Ribeiro, “A biased random-key genetic algorithm for single-round divisible load scheduling”, International Transactions in Operational Research 22 (2015), 823-839. (pdf)
  22. C.C. Ribeiro e I. Rosseti, “TTTPLOTS-COMPARE: A perl program to compare time-to-target plots or general runtime distributions of randomized algorithms”, Optimization Letters 9 (2015), 601-614. (pdf)
  23. J.S. Brandão, T.F. Noronha, M.G.C. Resende e C.C.Ribeiro, “A biased random-key genetic algorithm for scheduling divisible loads”, Multidisciplinary International Scheduling Conference: Theory and Applications, aceito. (pdf)
  24. L.M. Musmanno e C. C. Ribeiro, “Heuristics for the generalized median graph problem”, 11th Metaheuristics International Conference, paper #79, 2015. (pdf)
  25. J.S. Brandão, T.F. Noronha e C.C. Ribeiro, “A genetic algorithm for maximizing the accepted demands in routing and wavelength assignment in optical networks”, 11th Metaheuristics International Conference, paper #5, 2015. (pdf)
  26. B.Q. Pinto, A. Plastino, C.C. Ribeiro e I. Rosseti, “A biased random-key genetic algorithm to the maximum cardinality quasi-clique problem”, 11th Metaheuristics International Conference, paper #76, 2015. (pdf)
  27. F.L.P. Costa, L.G.P. Murta e C.C. Ribeiro, “Applying software engineering techniques in the development and management of linear and integer programming applications”, International Transactions in Operational Research 21 (2014), 1001-1030. (pdf)
  28. L. Bahiense, Y. Frota, T.F. Noronha e C.C. Ribeiro,“A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives”, Discrete Applied Mathematics, 164 (2014), 34-46. (pdf)
  29. R.E.N. Moraes e C.C. Ribeiro, “Power optimization in ad hoc wireless network topology control with biconnectivity requirements”, Computers & Operations Research 40 (2013), 3188-3196. (pdf)
  30. L.S. Pessôa, M.G.C. Resende e C.C. Ribeiro, “A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering”, Computers & Operations Research 40 (2013), 3132-3146. (pdf)
  31. J.S. Brandão. T.F. Noronha e C.C. Ribeiro, “Uma heurística eficiente para o problema de maximização das demandas atendidas em redes óticas”, Anais do XLV Simpósio Brasileiro de Pesquisa Operacional, 2578-2589, Natal, 2013. (pdf)
  32. C.C. Ribeiro, I. Rosseti e R. Souza, “Probabilistic stopping rules for GRASP heuristics and extensions”, International Transactions in Operational Research 20 (2013), 301-323. (pdf)
  33. R. Martí, M.G.C. Resende e C.C. Ribeiro, “A survey of multi-start methods for combinatorial optimization”, European Journal of Operational Research 226 (2013), 1-8.
  34. M.G.C. Resende e C.C. Ribeiro, “GRASP: Greedy Randomized Adaptive Search Procedures”, Search Methodologies (E.K. Burke e G. Kendall, editores), Capítulo 11, Springer, 2013, 2a edição, 287-312. (pdf)
  35. C.C. Ribeiro, I. Rosseti e R. Vallejos, “Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms”, Journal of Global Optimization 54 (2012), 405-429. (pdf)
  36. C.C. Ribeiro e S. Urrutia,“Scheduling the Brazilian soccer tournament: Solution approach and practice”, Interfaces 42 (2012), 260-272. (pdf)
  37. C.C.Ribeiro e M.G.C. Resende,“Path-relinking intensification methods for stochastic local search algorithms”, Journal of Heuristics 18 (2012), 193-214. (pdf)
  38. F.N. Costa, S. Urrutia e C.C. Ribeiro, “An ILS heuristic for the traveling tournament problem with predefined venues”, Annals of Operations Research 194 (2012), 137-150. (pdf)
  39. C.C. Ribeiro,“Sports scheduling: Problems and applications”, International Transactions in Operational Research 19 (2012), 201-226. (pdf)
  40. F.L.P. Costa, L.G.P. Murta e C.C. Ribeiro,“Ambiente de software para elaboração e gerenciamento de modelos matemáticos para problemas de programação linear e inteira”, Anais do XLIII Simpósio Brasileiro de Pesquisa Operacional, 2401-2411, Ubatuba, 2011. (pdf)
  41. A.P.F. Araújo, C. Boeres, V. Rebello e C.C. Ribeiro,“A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications”, International Transactions in Operational Research 18 (2011), 679-705. (pdf)
  42. A.C.B. Guedes e C.C. Ribeiro,“A heuristic for minimizing weighted carry-over effects in round robin tournaments”, Journal of Scheduling 14 (2011), 655-667. (pdf)
  43. L. Pessôa, M.G.C. Resende e C.C. Ribeiro,“Experiments with the LAGRASP heuristic for set k-covering”, Optimization Letters 5 (2011), 407-419. (pdf)
  44. M.G.C. Resende e C.C. Ribeiro, “Restart strategies for GRASP with path-relinking heuristics”, Optimization Letters 5 (2011), 467-478. (pdf)
  45. T.F. Noronha, M.G.C. Resende e C.C. Ribeiro,“A biased random-key genetic algorithm for routing and wavelength assignment”, Journal of Global Optimization 50 (2011), 503-518. (pdf)
  46. C.C. Ribeiro, I. Rosseti e R.C. Souza, “Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations”, Lecture Notes in Computer Science 6683 (2011), 146-160. (pdf)
  47. D. Aloise e C.C. Ribeiro, “Adaptive memory in multistart heuristics for multicommodity network design”, Journal of Heuristics 17 (2011), 153-179. (ps)
  48. K. Nurmi, D. Goossens, T. Bartsch, F. Bonomo, D. Briskorn, G. Duran, J. Kyngäs, J. Marenco, C.C. Ribeiro, F. Spieksma, S. Urrutia e R. Wolf-Yadlin,“A framework for scheduling professional sports leagues”, IAENG Transactions on Engineering Technologies (Sio-Iong Ao, Hideki Katagir, Li Xu e Alan Hoi-Shou Chan, editores), American Institute of Physics, volume 5, 14-28, 2010. (pdf)
  49. M.G.C. Resende, C.C. Ribeiro, F. Glover e R. Martí, “Scatter search and path-relinking: Fundamentals, advances, and applications”, Handbook of Metaheuristics (M. Gendreau e J.-Y. Potvin, editores), 87-107, Springer, 2010, 2a edição. (pdf)
  50. M.G.C. Resende e C.C. Ribeiro, “Greedy randomized adaptive search procedures: Advances, hybridizations, and applications”, Handbook of Metaheuristics (M. Gendreau e J.-Y. Potvin, editores), 283-319, Springer, 2010, 2a. edição. (pdf)
  51. L.S. Pessôa, M.G.C. Resende e C.C. Ribeiro, “A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering”, Third International Workshop on Model-Based Metaheuristics, 71-82, Viena, 2010. (pdf)
  52. C.C. Ribeiro e S. Urrutia“Scheduling the yearly national football tournament in Brazil”, 8th International Conference on the Practice and Theory of Automated Timetabling, Belfast, 2010. (pdf)
  53. A.S. Kligerman e C.C. Ribeiro,“A bi-criteria decision support system for the Brazilian hydrothermal operation planning”, Proceedings of the 25th Mini EURO Conference on Uncertainty and Robustness in Planning and Decision Making, Coimbra, 2010, ISBN 9789899505537. (pdf)
  54. K. Nurmi, D. Goossens, T. Bartsch, F. Bonomo, D. Briskorn, G. Duran, J. Kyngäs, J. Marenco, C.C. Ribeiro, F. Spieksma, S. Urrutia e R. Wolf, “A framework for a highly constrained sports scheduling problem”, Proceedings of the International MultiConference of Engineers and Computer Scientists 2010, volume III, 1991-1997, Hong-Kong, 2010. (pdf)
  55. T.F. Noronha, C.C. Ribeiro e A.C. Santos, “Solving diameter constrained minimum spanning tree problems by constraint programming”, International Transactions in Operational Research 17 (2010), 653-665. (pdf)
  56. C.C. Ribeiro e S. Urrutia, “Soccer scheduling goaaaaal!”, OR/MS Today 37:2 (2010), 52-57. (pdf)
  57. Y. Frota, N. Maculan, T.F. Noronha e C.C. Ribeiro, “A branch-and-cut algorithm for partition coloring”, Networks 55 (2010), 194-204. (pdf)
  58. A.P. Lucena, C.C. Ribeiro e A.C. Santos, “A hybrid heuristic for the diameter constrained minimum spanning tree problem”, Journal of Global Optimization 46 (2010), 363-381. (ps)
  59. G. Kendall, S. Knust, C.C. Ribeiro e S. Urutia, “Scheduling in sports: An annotated bibliography”, Computers and Operations Research 37 (2010), 1-19. (pdf)
  60. R.E.N. Moraes, C.C. Ribeiro e C. Duhamel, “Optimal solutions for fault-tolerant topology control in wireless ad hoc networks”, IEEE Transactions on Wireless Communications 8 (2009), 5970-5981. (pdf)
  61. L. Bahiense, Y. Frota, N. Maculan. T.F. Noronha e C.C. Ribeiro, “A branch-and-cut algorithm for equitable coloring based on a formulation by representatives”, Electronic Notes in Discrete Mathematics 35 (2009), 347-352. (pdf)
  62. R.A. Melo, S. Urrutia e C.C. Ribeiro, “The traveling tournament problem with predefined venues”, Journal of Scheduling, 12 (2009), 607-622. (pdf)
  63. C.C. Ribeiro, I. Rosseti e R. Vallejos, “On the use of run time distributions to evaluate and compare stochastic local search algorithms”, Engineering Stochastic Local Search Algorithms (T. Stützle, M. Biratari e H.H. Hoos, editores), Lecture Notes in Computer Science 5752 (2009), 16-30. (pdf) (trabalho premiado como "best paper presentation")
  64. C.C. Ribeiro e S. Urrutia, “Bicriteria integer programming approach for scheduling the Brazilian naional soccer tournament”, Proceedings of the Third International Conference on Management Science and Engineering Management, 46-49, Bangkok, 2009. (pdf)
  65. C.C. Ribeiro e D.S. Vianna, “A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy”, International Transactions in Operational Research 16 (2009), 641-657. (pdf)
  66. A. Guedes e C.C. Ribeiro, “A hybrid heuristic for minimizing weighted carry-over effects in round robin tournaments”, 4th Multidisciplinary International Conference on Scheduling Theory and Applications, 115-129, Dublin, 2009. (pdf)
  67. C.C. Ribeiro e I. Rosseti, “Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms”, VIII International Metaheuristics International Conference, id1-id6, Hamburg, 2009. (pdf)
  68. R.E.N. Moraes e C.C. Ribeiro, “Power control in ad hoc wireless network fault-tolerant design”, Proceedings of the Second Global Conference on Power Control and Optimization, Bali, 2009, ISBN 978-983-44483. (pdf)
  69. L. Bahiense, Y. Frota, N. Maculan. T.F. Noronha e C.C. Ribeiro,“A branch-and-cut algorithm for equitable coloring”, Proceedings of the International Network Optimization Conference, Pisa, 2009. (pdf)
  70. E. Abib e C.C. Ribeiro,“New heuristics and integer programming formulations for scheduling divisible load tasks”, Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Scheduling, 54-61, Nashville, 2009. (pdf)
  71. C.J.P. Lucena, T.F. Noronha, S. Urrutia e C.C. Ribeiro, “A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments”, International Transactions in Operational Research 15 (2008), 739-753. (ps)
  72. F.N. Costa, S. Urrutia e C.C. Ribeiro, “An ILS heuristic for the traveling tournament problem with predefined venues”, Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling, referência online em http://w1.cirrelt.ca/~patat2008/PATAT_7_PROCEEDINGS/Papers/Ribeiro-TC3d.pdf, Montréal, 2008. (ps)
  73. C.C. Ribeiro, D. Aloise, T.F. Noronha, C.T.M. Rocha e S. Urrutia“An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem”, European Journal of Operational Research 191 (2008), 596-611. (ps)
  74. C.C. Ribeiro, D. Aloise, T.F. Noronha, C.T.M. Rocha e S. Urrutia“A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints”, European Journal of Operational Research 191 (2008), 981-992. (ps)
  75. T.F. Noronha, M.G.C. Resende e C.C. Ribeiro, “Efficient implementations of routing and wavelength assignment heuristics”, Lecture Notes in Computer Science 5038 (2008), 169-180. (pdf)
  76. T.F. Noronha, C.C. Ribeiro e A.C. dos Santos, “Constraint programming for the diameter constrained minimum spanning tree problem”, Electronic Notes in Discrete Mathematics 30 (2008), 93-98. (ps)
  77. A.R. Duarte e C.C. Ribeiro, “Referee assignment in sports leagues: Approximate and exact multi-objective aproaches”, Abstract Book of the 19th International Conference on Multiple Criteria Decision Making, 58-60, Auckland, 2008. (ps)
  78. D.B.F. Carvalho, C.J.P. Lucena e C.C. Ribeiro, “Uma proposta de framework para desenvolvimento de aplicações paralelas com mobilidade”, Revista de Informática Teórica e Aplicada XIV (2007), número 2, 29-42. (pdf)
  79. S. Urrutia, A.C. de Souza, P. Stancioli e C.C. Ribeiro, “Maximização de quebras em torneios round-robin simples”, Anais do XXXIX Simpósio Brasileiro de Pesquisa Operacional, 2599-2609, Fortaleza, 2007. (pdf)
  80. Y. Frota, T.F. Noronha, C.C. Ribeiro e N. Maculan, “A branch-and-cut algorithm for the partition coloring problem”, Proceedings of the International Network Optimization Conference, Spa, 2007. (ps)
  81. A.P.F. Araújo, C. Boeres, V.E.F. Rebello, C.C. Ribeiro e S. Urrutia“Exploring grid implementations of parallel cooperative metaheuristics: A case study for the mirrored traveling tournament problem”, Metaheuristics: Progress in Complex Systems Optimization (K.F. Doerner, M. Gendreau, P. Greistorfer, W. Gutjahr, R.F. Hartl e M. Reimann, editores), 297-322, Springer, 2007. (ps)
  82. A.R. Duarte, C.C. Ribeiro, S. Urrutia e E.H. Haeusler, “Referee assignment in sports leagues”, Lecture Notes in Computer Science 3867 (2007), 158-173. (pdf)
  83. C.C. Ribeiro e S. Urrutia,“Scheduling the Brazilian soccer tournament with fairness and broadcast objectives”, Lecture Notes in Computer Science 3867 (2007), 147-157. (pdf)
  84. T.F. Noronha, C.C. Ribeiro, G. Duran, S. Souyris e A. Weintraub,“A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament”, Lecture Notes in Computer Science 3867 (2007), 174-186. (pdf)
  85. R.M. Aiex, M.G.C. Resende e C.C. Ribeiro, “TTTPLOTS: A Perl program to create time-to-target plots”, Optimization Letters 1 (2007), 355-366. (pdf)
  86. R.A. Melo, S. Urrutia e C.C. Ribeiro,“Scheduling single round robin tournaments with fixed venues”, Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA'07), 431-438, Paris, 2007. (ps)
  87. I.M.L. Martins e C.C. Ribeiro,“Extensão Universitária: Reforçando a missão social da Universidade”, Revista do Programa de Apoio à Extensão Universitária 2 (2007), 5-9. (pdf)
  88. A. Duarte, C.C. Ribeiro e S. Urrutia,“A hybrid ILS heuristic to the referee assignment problem with an embedded MIP strategy”, Lecture Notes in Computer Science 4771 (2007), 82-95. (ps)
  89. C.C. Ribeiro e R.F. Toso, “Experimental analysis of algorithms for updating minimum spanning trees subject to changes on edge weights”, Lecture Notes in Computer Science 4525 (2007), 393-405. (pdf)
  90. S. Urrutia, C.C. Ribeiro e R.A. Melo,“A new lower bound to the traveling tournament problem”, Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling (CI-Sched 2007), 15-18, Honolulu, 2007. (ps)
  91. C.C. Ribeiro e I. Rosseti, “Efficient parallel cooperative implementations of GRASP heuristics”, Parallel Computing 33 (2007), 21-35. (ps)
  92. C.C. Ribeiro, S.L. Martins e I. Rosseti, “Metaheuristics for optimization problems in computer communications”, Computer Comunications 30 (2007), 656-669. (ps)
  93. A.D. Legues, J.A. Ferland, C.C. Ribeiro, J.R. Vega e A. Weintraub,“A tabu search approach for solving a difficult forest harvesting machine location problem”, European Journal of Operational Research 179 (2007), 788-805. (pdf)
  94. C.C. Ribeiro e S. Urrutia, “Heuristics for the mirrored traveling tournament problem”, European Journal of Operational Research 179 (2007), 775-787. (ps)
  95. A.R. Duarte, C.C. Ribeiro e S. Urrutia, “Referee assignment in sports tournaments”, Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT' 06), 394-397, Brno, 2006. (ps)
  96. G. Durán, T.F. Noronha, C.C. Ribeiro, S. Souyris e A. Weintraub, “Branch-and-cut for a real-life highly constrained soccer tournament scheduling problem”, Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT' 06), 398-401, Brno, 2006. (ps)
  97. C.C. Ribeiro e S. Urrutia, “Scheduling the Brazilian soccer championship”, Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling (PATAT' 06), 481-483, Brno, 2006. (ps)
  98. F. Haddad, N. Maculan e C.C. Ribeiro, “Program PROUNI: Changing the panorama of access to higher education in Brazil”, IAU Horizons 12 (2006), 9-9. (jpg)
  99. D.J. Aloise, D. Aloise, C.T.M. Rocha, C.C. Ribeiro, J.C. Ribeiro Filho eL.S.S. Moura,“Scheduling workover rigs for onshore oil production”, Discrete Applied Mathematics 154 (2006), 695-702. (pdf)
  100. P.E. Coll, C.C. Souza e C.C. Ribeiro, “Multiprocessor scheduling under precedence constraints: Polyhedral results”, Discrete Applied Mathematics 154 (2006), 770-801. (ps)
  101. T.F. Noronha e C.C. Ribeiro, “Routing and wavelength assignment by partition coloring”, European Journal of Operational 171 (2006), 797-810. (ps)
  102. S. Urrutia e C.C. Ribeiro,“Maximizing breaks and bounding solutions to the mirrored raveling tournament problem”, Discrete Applied Mathematics 154 (2006), 1932-1938. (ps)
  103. S.L. Martins, C.C. Ribeiro e I. Rosseti, “Applications of parallel metaheuristics to optimization problems in telecommunications and bioinformatics”, Parallel Combinatorial Optimization (El.-G. Talbi, editor), Wiley, 301-325, 2006. (ps)
  104. C.C. Ribeiro, D. Aloise, T.F. Noronha, C.T. Rocha e S. Urrutia, “A hybrid heuristic for a real-life car sequencing problem with multiple requirements”, 18th Mini-EURO Conference on VNS, 2005. (ps)
  105. A.P.F. Araújo, S. Urrutia, C. Boeres, V.E.F. Rebello e C.C. Ribeiro, “Towards grid implementations of metaheuristics for hard combinatorial optimization problems”, Proceedings of the 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2005), 19-26, 2005. (pdf)
  106. N. Maculan e C.C. Ribeiro, “Coopération France-Brésil pour la formation d'Ingénieurs: Ecole Polytechnqiue de Rio de Janeiro et Ecole des Mines de Ouro Preto”, Dialogues entre le Brésil et la France: Formation et Coopération Académique (Carlos Benedito Martins, organizador), 257-260, Editora Massangana, 2005.
  107. C.C. Ribeiro, R.C. Souza e C.E.C. Vieira, “A comparative computational study of random number generators”, Pacific Journal of Optimization 1 (2005), 565-578. (ps)
  108. C.C. Ribeiro e S. Urrutia, “An application of integer programming to playoff elimination in football championships”, International Transactions in Operational Research 12 (2005), 375-386. (ps)
  109. E.R. Fernandes e C.C. Ribeiro, “Using an adaptive memory srategy to improve a multistart heuristic for sequencing by hybridization”, Lecture Notes in Computer Science 3503 (2005), 4-15. (ps)
  110. L.S. Buriol, M.G.C. Resende, C.C. Ribeiro e M. Thorup,“A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing”, Networks 46 (2005), 36-56. (ps)
  111. S.L. Martins e C.C. Ribeiro, “Metaheuristics and applications to optimization problems in telecommunications”, Handbook of Optimization in Telecommunications (P. Pardalos e M.G.C. Resende, eds.), 103-128, Springer-Verlag, 2005. (ps)
  112. E.R. Fernandes e C.C. Ribeiro, “A multistart constructive heuristic for sequencing by hybridization using adaptive memory”, Electronic Notes in Discrete Mathematics 19 (2005), 41-47. (ps)
  113. M.G.C. Resende e C.C. Ribeiro,“Parallel Greedy Randomized Adaptive Search Procedures”, Parallel Metaheuristics: A New Class of Algorithms (E. Alba, ed.), 315-346, Wiley, 2005. (ps)
  114. M.G.C. Resende e C.C. Ribeiro, “GRASP with path-relinking: Recent advances and applications”, Metaheuristics: Progress as Real Problem Solvers (T. Ibaraki, K. Nonobe e M. Yagiura, eds.), 29-63, Kluwer, 2005. (pdf)
  115. C.C. Ribeiro e D.S. Vianna, “A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure”, International Transactions in Operational Research 12 (2005), 325-338. (pdf)
  116. S.L. Martins, C.C. Ribeiro e I. Rosseti, “Applications and parallel implementations of metaheuristics in network design and routing”, Lecture Notes in Computer Science 3285 (2004), 205-213. (ps)
  117. S. Urrutia e C.C. Ribeiro, “Minimizing travels by maximizing breaks in round robin tournament schedules”, Electronic Notes in Discrete Mathematics 18-C (2004), 227-233. (ps)
  118. C.C. Ribeiro e S. Urrutia, “Heuristics for the mirrored traveling tournament problem”, Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT' 04), págs. 323- 342, Pittsburgh, 2004.
  119. A.C. Santos, A.P. Lucena e C.C. Ribeiro, “Solving diameter constrained minimum spanning trees in dense graphs”, Lecture Notes in Computer Science 3059 (2004), 463-472. (ps)
  120. M.C. Boeres, C.C. Ribeiro e I. Bloch, “A randomized heuristic for scene recognition by graph matching”, Lecture Notes in Computer Science 3059 (2004), 101-114.(ps)
  121. A.C. F. Alvim e C.C. Ribeiro, “A hybrid bin-packing heuristic to multiprocessor scheduling”, Lecture Notes in Computer Science 3059 (2004), 1-14. (ps)
  122. C.C. Ribeiro e S. Urrutia, “OR on the ball: Applications in sports scheduling and management", OR/MS Today 31 (2004), 50-54. (pdf)
  123. M.T. Medina, C.C. Ribeiro e L.F.G. Soares,“Automatic scheduling of hypermedia documents with elastic times”, Parallel Processing Letters14 (2004), 45-59. (ps)
  124. A.C.F. Alvim, F. Glover, C.C. Ribeiro e D.J. Aloise,“A hybrid improvement heuristic for the one-dimensional bin packing problem”, Journal of Heuristics 10 (2004), 205-229. (postscript)  
  125. A.C. F. Alvim e C.C. Ribeiro, “A hybrid improvement heuristic for the bin-packing problem and its application to the multiprocessor scheduling problem", Anais do XXIV Congresso da Sociedade Brasileira de Computação, págs. 406-413, Salvador, 2004. (pdf)
  126. C.C. Ribeiro e D.S. Vianna, "A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking", II Workshop Brasileiro de Bioinformática, págs. 97-102, Macaé, 2003. (postscript)
  127. T.F. Noronha e C.C. Ribeiro, “Atribuição de comprimentos de ondas em redes óticas por coloração de partições”, Anais do XXXV Simpósio Brasileiro de Pesquisa Operacional, págs. 1789-1795, Natal, 2003. (pdf)
  128. L.S. Buriol, P.M. França, M.G.C. Resende e C.C. Ribeiro, “Otimizando o roteamento do tráfego na Internet”, Anais do XXXV Simpósio Brasileiro de Pesquisa Operacional, págs. 1722-1732, Natal, 2003. (pdf)
  129. C.C. Ribeiro, M.V.F. Pereira, N.M.M. de Abreu e R.E. Campello, “Nelson Maculan Filho: Cientista e educador”, Pesquisa Operacional 23 (2003), 3-25. (pdf)
  130. M.C. Souza, C. Duhamel e C.C. Ribeiro, “A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy”, Metaheuristics: Computer Decision-Making (M.G.C. Resende e J. Souza, eds.), 627-658, Kluwer, 2003. (postscript)
  131. I.M. Rosseti, M.V. Poggi de Aragão, C.C. Ribeiro, E. Uchoa e R.F. Werneck, “New benchmark instances for the Steiner problem in graphs”, Metaheuristics: Computer Decision-Making (M.G.C. Resende e J. Souza, eds.), 601-614, Kluwer, 2003. (postscript)
  132. M.G.C. Resende e C.C. Ribeiro, “GRASP with path-relinking for private virtual circuit routing”, Networks 41 (2003), 104-114. (pdf)
  133. A. Plastino, C.C. Ribeiro e N. Rodriguez, “Developing SPMD applications with load balancing”, Parallel Computing 29 (2003), 743-766. (postscript)
  134. P. Festa, P.M. Pardalos, M.G.C. Resende e C.C. Ribeiro, “Randomized heutistics for the max-cut problem”, Optimization Methods and Sofware 6 (2002), 1033-1058. (pdf)
  135. P. Mahey e C.C. Ribeiro, "Optimal routing for multi-service communication networks", OR/MS Today 29 (2002), 40-43. (postscript)
  136. C.C. Ribeiro e I. Rosseti, “A parallel GRASP heuristic for the 2-path network design problem”, Lecture Notes in Computer Science 2400 (2002), 922-926. (postscript)
  137. M.G.C. Resende e C.C. Ribeiro, “Greedy randomized adaptive search procedures”, Handbook of Metaheuristics (F. Glover e G. Kochenberger, eds.), 219-249, Kluwer, 2002. (postscript)  
  138. C.C. Ribeiro, E. Uchoa e R.F. Werneck, “A hybrid GRASP with perturbations for the Steiner problem in graphs”, INFORMS Journal on Computing 14 (2002), 228-246. (postscript)
  139. E. Uchoa, M.V. Poggi de Aragão e C.C. Ribeiro, “Preprocessing Steiner problems from VLSI layout”, Networks 40 (2002), 38-50. (postscript)
  140. A.A. Andreatta e C.C. Ribeiro, “Heuristics for the phylogeny problem”, Journal of Heuristics 8 (2002), 429-447. (postscript)
  141. A.A. Andreatta, S.E.R. Carvalho e C.C. Ribeiro, “A framework for local search heuristics for combinatorial optimization problems”, in Optimization Software Class Libraries (S. Voss e D. Woodruff, eds.), 59-79, Kluwer, 2002. (postscript)
  142. R.M. Aiex, M.G.C. Resende e C.C. Ribeiro, “Probability distribution of solution time in GRASP: An experimental investigation”, Journal of Heuristics 8 (2002), 343-373. (pdf)
  143. C.C. Ribeiro e M.C. Souza, “Variable neighborhood search for the degree constrained minimum spanning tree problem”, Discrete Applied Mathematics 118 (2002), 43-54. (postscript)
  144. C.C. Ribeiro, “GRASP: Une métaheuristique gloutone et probabiliste”, Optimisation approchée en recherche opérationnelle (J. Teghem e M. Pirlot, editores), 153-176, Hermès, 2002. (postscript)
  145. S.L. Martins, C.C. Ribeiro e N.R. Rodriguez, “Parallel Computing Environments”, Handbook of Applied Optimization (P. Pardalos e M.G.C. Resende), 1029-1043, Oxford, 2002. (pdf)
  146. M. Fontoura, C.J. Lucena, A. Andreatta, S.E. Carvalho e C.C. Ribeiro, “Using UML-FW to enhance framework development: A case study in the local search heuristics domain”, Journal of Systems and Software 57 (2001), 201-206. (pdf)
  147. S.A. Canuto, M.G.C. Resende e C.C. Ribeiro, “Local search with perturbations for the prize-collecting Steiner tree problem in graphs”, Networks 38 (2001), 50-58. (postscript)
  148. V.-D. Cung, S.L. Martins, C.C. Ribeiro e C. Roucairol, “Strategies for the parallel implementation of metaheuristics”, in Essays and Surveys in Metaheuristics (C.C. Ribeiro e P. Hansen, eds.), 263-308, Kluwer, 2001. (pdf)
  149. C.C.B. Cavalcante, V.C. Cavalcante, C.C. Ribeiro e C.C. de Souza, “Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem”, in Essays and Surveys in Metaheuristics (C.C. Ribeiro e P. Hansen, editores), 201-225, Kluwer, 2001. (postscript)
  150. M.P. Bastos e C.C. Ribeiro, “Reactive tabu search with path-relinking for the Steiner problem in graphs”, in Essays and Surveys in Metaheuristics (C.C. Ribeiro e P. Hansen, editores), 39-58, Kluwer, 2001. (postscript)
  151. M.G. Resende e C.C. Ribeiro, “Graph Planarization”, Encyclopedia of Optimization 2 (2001), 368-373. (postscript)
  152. S.L. Martins, P. Pardalos, M.G.C. Resende e C.C. Ribeiro, “A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy”, Journal of Global Optimization 17 (2000), 267-283. (postscript)
  153. A. Plastino, C.C. Ribeiro e N.R. Rodriguez, “A framework for SPMD applications with load balancing”, Proceedings of the 12th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'2000), 245-252, São Pedro, 2000. (postscript)
  154. C.C. Ribeiro e M.C. Souza, “Tabu Search for the Steiner Problem in Graphs”, Networks 36 (2000), 138-146. (postscript)
  155. M. Prais e C.C. Ribeiro, “Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment”, INFORMS Journal on Computing 12 (2000), 164-176. (postscript)
  156. S.C. Porto, J.P. Kitajima e C.C. Ribeiro, “Performance Evaluation of a Parallel Tabu Search Task Scheduling Algorithm”, Parallel Computing 26 (2000), 73-90. (postscript)
  157. M. Prais e C.C. Ribeiro, “Variação de parâmetros em procedimentos GRASP”, Investigación Operativa 9 (2000), 1-20. (postscript)
  158. A. Plastino, C.C. Ribeiro e N.R. Rodriguez, “A tool for SPMD application development with support for load balancing”, Parallel Computing: Fundamentals and Applications (Proceedings of the International Conference ParCo'99, E.H.D'Hollander, G.R.Joubert, F.J.Peters e H.J.Sips, editores), 639-646, Imperial College Press, 2000. (postscript)
  159. C.C. Ribeiro e M.G. Resende, “Algorithm 797: FORTRAN Subroutines for Approximate Solution of Graph Planarization Problems using GRASP”, ACM Transactions on Mathematical Software 25 (1999), 341-352. (postscript)
  160. N. Maculan, S.C. Porto, C.C. Ribeiro e C.C. de Souza, “A New Formulation for Scheduling Unrelated Processors under Precedence Constraints”, RAIRO Recherche Opérationnelle 33 (1999), 87-90. (postscript)
  161. B. Jaumard, P. Labit e C.C. Ribeiro, “A column generation approach to cell formation problems in cellular manufacturing”, 3rd International Industrial Engineering Conference, Montréal, Canadá, 1999. (postscript)
  162. C.C. Ribeiro e N.R. Rodriguez, “Otimização e Processamento Paralelo de Alto Desempenho”, Revista PUC Ciência, dezembro 1999, 45-48. (pdf)
  163. A. Perchant, C. Boeres, I. Bloch, M. Roux e C.C. Ribeiro, “Model-based scene recognition using graph fuzzy homomorphism solved by genetic algorithm”, 2nd IAPR TC-15 Workshop on Graph-based Representations in Pattern Recognition, 61-70, Haindorf, Austria, 1999. (postscript)
  164. A.C.F. Alvim e C.C. Ribeiro, “Balanceamento de Carga na Paralelização da Meta-heurística GRASP”, X Simpósio Brasileiro de Arquiteturas de Computadores, 1998, Sociedade Brasileira de Computação, 279-282. (postscript)
  165. A.A. Andreatta, S.E.R. Carvalho e C.C. Ribeiro, “An Object-Oriented Framework for Local Search Heuristics”, 26th Conference on Technology of Object-Oriented Languages and Systems (TOOLS USA'98), 1998, IEEE Computer Society, 33-45. (postscript)
  166. S.L. Martins, P. Pardalos, M.G. Resende e C.C. Ribeiro, “Greedy Randomized Adaptive Search Procedures for for the Steiner Problem in Graphs”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1998), 133-145. (postscript)
  167. S.L. Martins, C.C. Ribeiro e M.C. Souza, “A Parallel GRASP for the Steiner Problem in Graphs”, Lecture Notes in Computer Science 1457 (1998), 285-297. (postscript)
  168. R.M. Aiex, S.L. Martins, C.C. Ribeiro e N.R. Rodriguez, “Cooperative Multi-Thread Parallel Tabu Search with an Application to Circuit Partitioning”, Lecture Notes in Computer Science 1457 (1998), 310--331. (postscript)
  169. S. Lifschitz, A. Plastino e C.C. Ribeiro, “Exploring Load Balancing in Parallel Processing of Recursive Queries”, Lecture Notes in Computer Science 1300 (1997), 1125-1129. (postscript)
  170. M.G. Resende e C.C. Ribeiro, “A GRASP for Graph Planarization”, Networks 29 (1997), 173-189. (postscript)
  171. C.C. Ribeiro, C.D. Ribeiro e R.S. Lanzelotte, “Query Optimization in Distributed Relational Databases”, Journal of Heuristics 3 (1997), 5-23.
  172. S.C. Porto e C.C. Ribeiro, “A Case Study on Parallel Synchronous Implementations of Tabu Search Based on Neighborhood Decomposition”, Investigación Operativa 5 (1996), 233-259. (postscript)
  173. S.L. Martins, C.C. Ribeiro e N.R. Rodriguez, “Ferramentas de Programação Paralela em Ambientes de Memória Distribuída”, Investigación Operativa 5 (1996), 67-98. (postscript - sem algumas figuras)
  174. S.C. Porto e C.C. Ribeiro, “Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling under Precedence Constraints”, Journal of Heuristics 1 (1995), 207-223. (postscript)
  175. S.C. Porto e C.C. Ribeiro, “A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints”, International Journal of High Speed Computing 7 (1995), 45-71. (postscript)
  176. A.A. Andreatta e C.C. Ribeiro, “A Graph Partitioning Heuristic for the Parallel Pseudo-Exhaustive Logical Test of VLSI Combinational Circuits”, Annals of Operations Research 50 (1994), 1-36.
  177. A. Hertz, B. Jaumard, C.C. Ribeiro e W.P. Formosinho Filho, “A Multi-Criteria Tabu Search Approach to Cell Formation Problems in Group Technology with Multiple Objectives”, RAIRO Recherche Opérationnelle 28 (1994), 303-328.
  178. P. Hansen, E.L. Pedrosa Filho e C.C. Ribeiro, “Modelling Location and Sizing of Offshore Platforms”, European Journal of Operational Research 72 (1994), 602-606.
  179. A. Hertz, B. Jaumard e C.C. Ribeiro, “A Graph Theory Approach to Subcontracting, Machine Duplication and Intercell Moves in Cellular Manufacturing”, Discrete Applied Mathematics 50 (1994), 255-265.
  180. C.M.Leopoldino, M.V. Pereira, L.M. Pinto e C.C. Ribeiro, “A Constraint Generation Scheme for Probabilistic Linear Problems with an Application to Power System Expansion Planning”, Annals of Operations Research 50 (1994), 367-385.
  181. C.C. Ribeiro e F. Soumis, “A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem”, Operations Research 42 (1994), 41-52. (pdf)
  182. B. Jaumard e C.C. Ribeiro, “Implication Graph and Quadratic 0-1 Optimization”, Investigación Operativa 4 (1994), 85-101.
  183. C.C. de Souza e C.C. Ribeiro, “New Efficient Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study”, Discrete Applied Mathematics 45 (1993), 205-220.
  184. B. Jaumard, M. Prais e C.C. Ribeiro, “Penalty Computations for the Set Partitioning Problem”, Annals of Operations Research 43 (1993), 285-293.
  185. J.-P. Barthélemy, S.G. de Amorim Jr. e C.C. Ribeiro, “Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches”, Journal of Classification 9 (1992), 17-41.
  186. P. Hansen, E.L. Pedrosa Filho e C.C. Ribeiro, “Location and Sizing of Offshore Platforms for Oil Exploration”, European Journal of Operational Research 58 (1992), 202-214.
  187. Atallah, S. Lifschitz e C.C. Ribeiro, “A Linear Time Algorithm for the Computation of Some Distance Functions between Convex Polygons”, RAIRO Recherche Opérationnelle 25 (1991), 413-424.
  188. P. Hansen, M.V. Poggi de Aragão e C.C. Ribeiro, “Hyperbolic 0-1 Programming and Query Optimization in Information Retrieval”, Mathematical Programming 52 (1991), 255-263.
  189. M.J. Atallah, S. Lifschitz e C.C. Ribeiro, “Computing Some Distance Functions between Polygons”, Pattern Recognition 24 (1991), 775-781.
  190. P. Hansen, M.V. Poggi de Aragão e C.C. Ribeiro, “Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem”, Annals of Mathematics and Artificial Intelligence 1 (1990), 97-109.
  191. C.C. de Souza e C.C. Ribeiro, “A Tight Worst Case Bound for the Performance Ratio of Heuristics for the Minimum Rectilinear Steiner Tree Problem”, OR Spektrum 12 (1990), 109-111.
  192. C.C. de Souza e C.C. Ribeiro, “O Problema de Steiner na Métrica Retilínea”, Investigación Operativa 1 (1990), 213-249.
  193. C.C. Ribeiro, M. Minoux e M.C. Penna, “An Optimal Column-Generation-with-Ranking Algorithm for Very Large Scale Set Partitioning Problems in Traffic Assignment”, European Journal of Operational Research 41 (1989), 232-239.
  194. P. Cox, H. Maitre, M. Minoux e C.C. Ribeiro, “Optimal Matching of Convex Polygons”, Pattern Recognition Letters 9 (1989), 327-334.
  195. L. Toscani e C.C. Ribeiro, “Análise da Complexidade de Algoritmos em Arquiteturas Paralelas - Estudo de Caso: A Técnica de Divisão e Conquista”, Pesquisa Operacional 7 (1987), no. 2, 66-86.
  196. S.M. Amado e C.C. Ribeiro, “Short-Term Generation Scheduling of Hydraulic Multi-Reservoir Multi-Area Interconnected Systems”, IEEE Transactions on Power Systems PWRS-2 (1987), 758-763.
  197. C.C. Ribeiro, “Parallel Computer Models and Combinatorial Algorithms”, Annals of Discrete Mathematics 31 (1987), 325-364.
  198. M. Minoux e C.C. Ribeiro, “Solving Hard Constrained Shortest Path Problems by Lagrangean Relaxation and Branch-and-Bound Algorithms”, Methods of Operations Research 53 (1986), 305-316.
  199. C.C. Ribeiro, “Le Calcul Parallèle et ses Applications en Optimisation Combinatoire”, L'Écho des Recherches 119/120 (1985), 57-64.
  200. M. Minoux e C.C. Ribeiro, “A Heuristic Approach to Hard Constrained Shortest Path Problems”, Discrete Applied Mathematics 10 (1985), 125-138.
  201. C.C. Ribeiro, “Performance Evaluation of Vector Implementations of Combinatorial Algorithms”, Parallel Computing 1 (1984), 287-294.
  202. M. Minoux e C.C. Ribeiro, “A Transformation of Hard (Equality Constrained) Knapsack Problems into
    Constrained Shortest Path Problems”, Operations Research Letters 3 (1984), 211-214.

TOPO

Última atualização: 22/novembro/2008