default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCelso C. Ribeiro
Person information
- affiliation: Universidade Federal Fluminense, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j124]Ruben Interian
, Igor Carpanese, Bruno Mello, Celso C. Ribeiro:
Red flag algorithms for Brazilian electronic invoices: outlier detection and price risk classification. Int. Trans. Oper. Res. 31(3): 1533-1553 (2024)- 2023
- [j123]Juan G. Villegas, Jorge E. Mendoza, Celso C. Ribeiro, Rubén Ruiz, Andrés L. Medaglia:
Preface to the Special Issue on Developments in Metaheuristics. Int. Trans. Oper. Res. 30(2): 653-654 (2023) - [j122]Celso C. Ribeiro, Peter C. Bell:
Celebrating 30 years of International Transactions in Operational Research. Int. Trans. Oper. Res. 30(4): 1583-1588 (2023) - [j121]Luce Brotcorne, Mario Guajardo, Celso C. Ribeiro, Maria Grazia Speranza:
Tutorials and Reviews in Operations Research. Int. Trans. Oper. Res. 30(6): 2707-2708 (2023) - [j120]Ruben Interian, Ruslán G. Marzo, Isela Mendoza, Celso C. Ribeiro:
Network polarization, filter bubbles, and echo chambers: an annotated review of measures and reduction methods. Int. Trans. Oper. Res. 30(6): 3122-3158 (2023) - [j119]Rafael A. Melo, Celso C. Ribeiro:
MIP formulations for induced graph optimization problems: a tutorial. Int. Trans. Oper. Res. 30(6): 3159-3200 (2023) - [j118]Celso C. Ribeiro, Sebastián Urrutia, Dominique de Werra:
A tutorial on graph models for scheduling round-robin sports tournaments. Int. Trans. Oper. Res. 30(6): 3267-3295 (2023) - [j117]Samuel Eduardo da Silva, Celso C. Ribeiro, Uéverton dos Santos Souza:
A biased random-key genetic algorithm for the chordal completion problem. RAIRO Oper. Res. 57(3): 1559-1578 (2023) - 2022
- [j116]Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos:
New formulations and branch-and-cut procedures for the longest induced path problem. Comput. Oper. Res. 139: 105627 (2022) - [j115]Rafael A. Melo, Celso C. Ribeiro, José A. Riveaux:
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study. Inf. Sci. 612: 655-674 (2022) - [j114]Rafael A. Melo, Celso C. Ribeiro:
Maximum weighted induced forests and trees: new formulations and a computational comparative review. Int. Trans. Oper. Res. 29(4): 2263-2287 (2022) - [j113]Carlos R. H. Márquez, Celso C. Ribeiro:
Shop scheduling in manufacturing environments: a review. Int. Trans. Oper. Res. 29(6): 3237-3293 (2022) - [i3]Ruben Interian, Ruslán G. Marzo, Isela Mendoza, Celso C. Ribeiro:
Network polarization, filter bubbles, and echo chambers: An annotated review of measures, models, and case studies. CoRR abs/2207.13799 (2022) - 2021
- [j112]Rafael A. Melo, Michell F. Queiroz, Celso C. Ribeiro:
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem. Eur. J. Oper. Res. 289(1): 75-92 (2021) - [j111]Rafael B. Velasco, Igor Carpanese, Ruben Interian, Octávio C. G. Paulo Neto, Celso C. Ribeiro:
A decision support system for fraud detection in public procurement. Int. Trans. Oper. Res. 28(1): 27-47 (2021) - [j110]Ruben Interian, Jorge R. Moreno, Celso C. Ribeiro:
Polarization reduction by minimum-cardinality edge additions: Complexity and integer programming approaches. Int. Trans. Oper. Res. 28(3): 1242-1264 (2021) - [j109]Ruslán G. Marzo, Celso C. Ribeiro:
Exact and approximate algorithms for the longest induced path problem. RAIRO Oper. Res. 55(2): 333-353 (2021) - [j108]Bruno Q. Pinto, Celso C. Ribeiro, José A. Riveaux, Isabel Rosseti:
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy. RAIRO Oper. Res. 55(Supplement): S741-S763 (2021) - [c26]Celso C. Ribeiro, José A. Riveaux, Julliany S. Brandão:
Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy. ISMSI 2021: 28-36 - [i2]Rafael A. Melo, Celso C. Ribeiro:
Maximum weighted induced forests and trees: New formulations and a computational comparative review. CoRR abs/2102.09194 (2021) - [i1]Ruslán G. Marzo, Rafael A. Melo, Celso C. Ribeiro, Marcio Costa Santos:
New formulations and branch-and-cut procedures for the longest induced path problem. CoRR abs/2104.09227 (2021) - 2020
- [j107]Ruslán G. Marzo, Celso C. Ribeiro:
A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem. Int. Trans. Oper. Res. 27(3): 1419-1446 (2020) - [j106]Bruno Q. Pinto, Celso C. Ribeiro, Isabel Rosseti, Thiago F. Noronha:
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model. J. Glob. Optim. 77(4): 949-973 (2020) - [j105]Celso C. Ribeiro, Philippe L. F. dos Santos:
A heuristic for the minimum cost chromatic partition problem. RAIRO Oper. Res. 54(3): 845-871 (2020) - [c25]Ruben Interian, Jorge R. Moreno, Celso C. Ribeiro:
Reducing Network Polarization by Edge Additions. ISMSI 2020: 87-92
2010 – 2019
- 2019
- [j104]Celso C. Ribeiro, Tiago de A. Santos, Cid C. de Souza:
Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic. Int. Trans. Oper. Res. 26(4): 1339-1364 (2019) - [j103]Celso C. Ribeiro, José A. Riveaux:
An exact algorithm for the maximum quasi-clique problem. Int. Trans. Oper. Res. 26(6): 2199-2229 (2019) - 2018
- [j102]Ruben Interian, Celso C. Ribeiro:
An empirical investigation of network polarization. Appl. Math. Comput. 339: 651-662 (2018) - [j101]Bruno Q. Pinto, Celso C. Ribeiro, Isabel Rosseti, Alexandre Plastino:
A biased random-key genetic algorithm for the maximum quasi-clique problem. Eur. J. Oper. Res. 271(3): 849-865 (2018) - [j100]El-Ghazali Talbi, Celso C. Ribeiro:
Special issue on "Optimization and Machine Learning". Int. Trans. Oper. Res. 25(4): 1407 (2018) - [j99]Alberto Reyes, Celso C. Ribeiro:
Extending time-to-target plots to multiple instances. Int. Trans. Oper. Res. 25(5): 1515-1536 (2018) - 2017
- [j98]Ruben Interian, Juan M. Otero, Celso C. Ribeiro, Anselmo Antunes Montenegro:
Curve and surface fitting by implicit polynomials: Optimum degree finding and heuristic refinement. Comput. Graph. 67: 14-23 (2017) - [j97]Rafael A. Melo, Celso C. Ribeiro:
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds. Int. J. Prod. Res. 55(2): 576-592 (2017) - [j96]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems. Int. Trans. Oper. Res. 24(5): 1061-1077 (2017) - [j95]Ruben Interian, Celso C. Ribeiro:
A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem. Int. Trans. Oper. Res. 24(6): 1307-1323 (2017) - 2016
- [j94]Tiago Januario, Sebastián Urrutia, Celso C. Ribeiro, Dominique de Werra:
Edge coloring: A natural model for sports scheduling. Eur. J. Oper. Res. 254(1): 1-8 (2016) - [j93]Leonardo M. Musmanno, Celso C. Ribeiro:
Heuristics for the generalized median graph problem. Eur. J. Oper. Res. 254(2): 371-384 (2016) - [j92]Renato E. N. Moraes, Celso C. Ribeiro, Glaydston Mattos Ribeiro:
Exact formulations for the minimum interference problem in k-connected ad hoc wireless networks. Int. Trans. Oper. Res. 23(6): 1113-1139 (2016) - [j91]Julliany S. Brandão, Thiago F. Noronha, Celso C. Ribeiro:
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks. J. Glob. Optim. 65(4): 813-835 (2016) - [j90]Mariana Tasca, Alexandre Plastino, Celso C. Ribeiro, Bianca Zadrozny:
A Fast and Effective Strategy for Feature Selection in High-dimensional Datasets. J. Inf. Data Manag. 7(2): 155-165 (2016) - [c24]Mauricio G. C. Resende, Celso C. Ribeiro:
Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial. GECCO (Companion) 2016: 483-514 - 2015
- [j89]Rafael A. Melo, Celso C. Ribeiro:
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking. Comput. Ind. Eng. 85: 402-413 (2015) - [j88]Celso C. Ribeiro, Vittorio Maniezzo:
Preface to the Special Issue on Matheuristics: Model-Based Metaheuristics. Int. Trans. Oper. Res. 22(1): 1 (2015) - [j87]Celso C. Ribeiro:
Preface to the Special Issue on Operations Research in Practice. Int. Trans. Oper. Res. 22(3): 383 (2015) - [j86]Julliany S. Brandão, Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for single-round divisible load scheduling. Int. Trans. Oper. Res. 22(5): 823-839 (2015) - [j85]Celso C. Ribeiro, Isabel Rosseti:
tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms. Optim. Lett. 9(3): 601-614 (2015) - 2014
- [j84]Laura Bahiense, Yuri Frota, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discret. Appl. Math. 164: 34-46 (2014) - [j83]Fernando Costa, Leonardo Murta, Celso C. Ribeiro:
Applying software engineering techniques in the development and management of linear and integer programming applications. Int. Trans. Oper. Res. 21(6): 1001-1030 (2014) - 2013
- [j82]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications. Comput. Oper. Res. 40(12): 3080 (2013) - [j81]Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering. Comput. Oper. Res. 40(12): 3132-3146 (2013) - [j80]Renato E. N. Moraes, Celso C. Ribeiro:
Power optimization in ad hoc wireless network topology control with biconnectivity requirements. Comput. Oper. Res. 40(12): 3188-3196 (2013) - [j79]Rafael Martí, Mauricio G. C. Resende, Celso C. Ribeiro:
Multi-start methods for combinatorial optimization. Eur. J. Oper. Res. 226(1): 1-8 (2013) - [j78]Celso C. Ribeiro, Isabel Rosseti, Reinaldo C. Souza:
Probabilistic stopping rules for GRASP heuristics and extensions. Int. Trans. Oper. Res. 20(3): 301-323 (2013) - 2012
- [j77]Fabrício N. Costa, Sebastián Urrutia, Celso C. Ribeiro:
An ILS heuristic for the traveling tournament problem with predefined venues. Ann. Oper. Res. 194(1): 137-150 (2012) - [j76]Celso C. Ribeiro, Mauricio G. C. Resende:
Path-relinking intensification methods for stochastic local search algorithms. J. Heuristics 18(2): 193-214 (2012) - [j75]Celso C. Ribeiro, Sebastián Urrutia:
Scheduling the Brazilian Soccer Tournament: Solution Approach and Practice. Interfaces 42(3): 260-272 (2012) - [j74]Celso C. Ribeiro, Irene Loiseau:
Tutorials in Operations Research. Int. Trans. Oper. Res. 19(1-2): 1 (2012) - [j73]Celso C. Ribeiro:
Sports scheduling: Problems and applications. Int. Trans. Oper. Res. 19(1-2): 201-226 (2012) - [j72]Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos Campos:
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Glob. Optim. 54(2): 405-429 (2012) - 2011
- [j71]Daniel Aloise, Celso C. Ribeiro:
Adaptive memory in multistart heuristics for multicommodity network design. J. Heuristics 17(2): 153-179 (2011) - [j70]Aletéia P. F. Araújo, Cristina Boeres, Vinod E. F. Rebello, Celso C. Ribeiro:
A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications. Int. Trans. Oper. Res. 18(6): 679-705 (2011) - [j69]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
A biased random-key genetic algorithm for routing and wavelength assignment. J. Glob. Optim. 50(3): 503-518 (2011) - [j68]Luciana S. Pessoa, Mauricio G. C. Resende, Celso C. Ribeiro:
Experiments with LAGRASP heuristic for set k-covering. Optim. Lett. 5(3): 407-419 (2011) - [j67]Mauricio G. C. Resende, Celso C. Ribeiro:
Restart strategies for GRASP with path-relinking heuristics. Optim. Lett. 5(3): 467-478 (2011) - [j66]Allison C. B. Guedes, Celso C. Ribeiro:
A heuristic for minimizing weighted carry-over effects in round robin tournaments. J. Sched. 14(6): 655-667 (2011) - [c23]Celso C. Ribeiro, Isabel Rosseti, Reinaldo C. Souza:
Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations. LION 2011: 146-160 - 2010
- [j65]Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia:
Scheduling in sports: An annotated bibliography. Comput. Oper. Res. 37(1): 1-19 (2010) - [j64]Thiago F. Noronha, Celso C. Ribeiro, Andréa C. Santos:
Solving diameter-constrained minimum spanning tree problems by constraint programming. Int. Trans. Oper. Res. 17(5): 653-665 (2010) - [j63]Abilio Lucena, Celso C. Ribeiro, Andréa C. Santos:
A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46(3): 363-381 (2010) - [j62]Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A branch-and-cut algorithm for partition coloring. Networks 55(3): 194-204 (2010)
2000 – 2009
- 2009
- [j61]Laura Bahiense, Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro:
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives. Electron. Notes Discret. Math. 35: 347-352 (2009) - [j60]Celso C. Ribeiro, Dalessandro Soares Vianna:
A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy. Int. Trans. Oper. Res. 16(5): 641-657 (2009) - [j59]Rafael A. Melo, Sebastián Urrutia, Celso C. Ribeiro:
The traveling tournament problem with predefined venues. J. Sched. 12(6): 607-622 (2009) - [j58]Renato E. N. Moraes, Celso C. Ribeiro, Christophe Duhamel:
Optimal solutions for fault-tolerant topology control in wireless ad hoc networks. IEEE Trans. Wirel. Commun. 8(12): 5970-5981 (2009) - [c22]Elbio Renato Torres Abib, Celso C. Ribeiro:
New heuristics and integer programming formulations for scheduling divisible load tasks. CISched 2009: 54-61 - [c21]Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos Campos:
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms. SLS 2009: 16-30 - [r1]Mauricio G. C. Resende, Celso C. Ribeiro:
Graph Planarization. Encyclopedia of Optimization 2009: 1448-1453 - 2008
- [j57]Thiago F. Noronha, Andréa C. Santos, Celso C. Ribeiro:
Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 30: 93-98 (2008) - [j56]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem. Eur. J. Oper. Res. 191(3): 596-611 (2008) - [j55]Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha, Caroline T. M. Rocha, Sebastián Urrutia:
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur. J. Oper. Res. 191(3): 981-992 (2008) - [j54]Carlos José Pereira de Lucena, Thiago F. Noronha, Celso C. Ribeiro, Sebastián Urrutia:
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments. Int. Trans. Oper. Res. 15(6): 739-753 (2008) - [c20]Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro:
Efficient Implementations of Heuristics for Routing and Wavelength Assignment. WEA 2008: 169-180 - 2007
- [j53]Celso C. Ribeiro, Simone L. Martins, Isabel Rosseti:
Metaheuristics for optimization problems in computer communications. Comput. Commun. 30(4): 656-669 (2007) - [j52]Celso C. Ribeiro, Sebastián Urrutia:
Heuristics for the mirrored traveling tournament problem. Eur. J. Oper. Res. 179(3): 775-787 (2007) - [j51]Andres Diaz Legües, Jacques A. Ferland, Celso C. Ribeiro, Jorge R. Vera, Andrés Weintraub:
A tabu search approach for solving a difficult forest harvesting machine location problem. Eur. J. Oper. Res. 179(3): 788-805 (2007) - [j50]Celso C. Ribeiro:
Letter from the Editor. Int. Trans. Oper. Res. 14(5): 369-370 (2007) - [j49]Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro:
TTT plots: a perl program to create time-to-target plots. Optim. Lett. 1(4): 355-366 (2007) - [j48]Celso C. Ribeiro, Isabel Rosseti:
Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33(1): 21-35 (2007) - [j47]Dárlinton B. F. Carvalho, Carlos José Pereira de Lucena, Celso C. Ribeiro:
Uma Proposta de Framework para Desenvolvimento de Aplicações Paralelas com Mobilidade. RITA 14(2): 29-42 (2007) - [c19]Sebastián Urrutia, Celso C. Ribeiro, Rafael A. Melo:
A New Lower Bound to the Traveling Tournament Problem. CISched 2007: 15-18 - [c18]Alexandre R. Duarte, Celso C. Ribeiro, Sebastián Urrutia:
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy. Hybrid Metaheuristics 2007: 82-95 - [c17]Celso C. Ribeiro, Rodrigo F. Toso:
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights. WEA 2007: 393-405 - [p3]Aletéia P. F. Araújo, Cristina Boeres, Vinod E. F. Rebello, Celso C. Ribeiro, Sebastián Urrutia:
Exploring Grid Implementations of Parallel Cooperative Metaheuristics. Metaheuristics 2007: 297-322 - 2006
- [j46]Celso C. Ribeiro:
Preface. Discret. Appl. Math. 154(5): 693 (2006) - [j45]Dario J. Aloise, Daniel Aloise, Caroline T. M. Rocha, Celso C. Ribeiro, José C. Ribeiro Filho, Luiz S. S. Moura:
Scheduling workover rigs for onshore oil production. Discret. Appl. Math. 154(5): 695-702 (2006) - [j44]Pablo E. Coll, Celso C. Ribeiro, Cid C. de Souza:
Multiprocessor scheduling under precedence constraints: Polyhedral results. Discret. Appl. Math. 154(5): 770-801 (2006) - [j43]Sebastián Urrutia, Celso C. Ribeiro:
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem. Discret. Appl. Math. 154(13): 1932-1938 (2006) - [j42]Thiago F. Noronha, Celso C. Ribeiro:
Routing and wavelength assignment by partition colouring. Eur. J. Oper. Res. 171(3): 797-810 (2006) - [c16]Celso C. Ribeiro, Sebastián Urrutia:
Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives. PATAT 2006: 147-157 - [c15]Alexandre R. Duarte, Celso C. Ribeiro, Sebastián Urrutia, Edward Hermann Haeusler:
Referee Assignment in Sports Leagues. PATAT 2006: 158-173 - [c14]Thiago F. Noronha, Celso C. Ribeiro, Guillermo Durán, Sebastian Souyris, Andrés Weintraub:
A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament. PATAT 2006: 174-186 - [p2]Simone L. Martins, Celso C. Ribeiro:
Metaheuristics and Applications to Optimization Problems in Telecommunications. Handbook of Optimization in Telecommunications 2006: 103-128 - 2005
- [j41]Eraldo L. R. Fernandes, Celso C. Ribeiro:
A multistart constructive heuristic for sequencing by hybridization using adaptive memory. Electron. Notes Discret. Math. 19: 41-47 (2005) - [j40]Celso C. Ribeiro, Dalessandro Soares Vianna:
A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Int. Trans. Oper. Res. 12(3): 325-338 (2005) - [j39]Celso C. Ribeiro, Sebastián Urrutia:
An application of integer programming to playoff elimination in football championships. Int. Trans. Oper. Res. 12(4): 375-386 (2005) - [j38]Celso C. Ribeiro, Simone L. Martins:
Preface. ACM J. Exp. Algorithmics 10 (2005) - [j37]Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup:
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 46(1): 36-56 (2005) - [c13]Eraldo L. R. Fernandes, Celso C. Ribeiro:
Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization. WEA 2005: 4-15 - 2004
- [j36]Sebastián Urrutia, Celso C. Ribeiro:
Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules. Electron. Notes Discret. Math. 18: 227-233 (2004) - [j35]Adriana C. F. Alvim, Celso C. Ribeiro, Fred W. Glover, Dario J. Aloise:
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem. J. Heuristics 10(2): 205-229 (2004) - [j34]Maira T. Medina, Celso C. Ribeiro, Luiz F. G. Soares:
Automatic Scheduling Of Hypermedia Documents With Elastic Times. Parallel Process. Lett. 14(1): 45-59 (2004) - [c12]Simone L. Martins, Celso C. Ribeiro, Isabel Rosseti:
Applications and Parallel Implementations of Metaheuristics in Network Design and Routing. AACC 2004: 205-213 - [c11]Adriana C. F. Alvim, Celso C. Ribeiro:
A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling. WEA 2004: 1-13 - [c10]Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch:
A Randomized Heuristic for Scene Recognition by Graph Matching. WEA 2004: 100-113 - [c9]Andréa C. dos Santos, Abilio Lucena, Celso C. Ribeiro:
Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. WEA 2004: 458-467 - [e1]Celso C. Ribeiro, Simone L. Martins:
Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings. Lecture Notes in Computer Science 3059, Springer 2004, ISBN 3-540-22067-4 [contents] - 2003
- [j33]Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP with path-relinking for private virtual circuit routing. Networks 41(2): 104-114 (2003) - [j32]Alexandre Plastino, Celso C. Ribeiro, Noemi de La Rocque Rodriguez:
Developing SPMD applications with load balancing. Parallel Comput. 29(6): 743-766 (2003) - [c8]Celso C. Ribeiro, Dalessandro Soares Vianna:
A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. WOB 2003: 97-102 - [p1]Mauricio G. C. Resende, Celso C. Ribeiro:
Greedy Randomized Adaptive Search Procedures. Handbook of Metaheuristics 2003: 219-249 - 2002
- [j31]Celso C. Ribeiro, Maurício C. de Souza:
Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discret. Appl. Math. 118(1-2): 43-54 (2002) - [j30]Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro:
Probability Distribution of Solution Time in GRASP: An Experimental Investigation. J. Heuristics 8(3): 343-373 (2002) - [j29]Alexandre A. Andreatta, Celso C. Ribeiro:
Heuristics for the Phylogeny Problem. J. Heuristics 8(4): 429-447 (2002) - [j28]Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck:
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. INFORMS J. Comput. 14(3): 228-246 (2002) - [j27]Eduardo Uchoa, Marcus Poggi de Aragão, Celso C. Ribeiro:
Preprocessing Steiner problems from VLSI layout. Networks 40(1): 38-50 (2002) - [j26]Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Randomized heuristics for the Max-Cut problem. Optim. Methods Softw. 17(6): 1033-1058 (2002) - [c7]Celso C. Ribeiro, Isabel Rosseti:
A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note). Euro-Par 2002: 922-926 - 2001
- [j25]Marcus Fontoura, Carlos José Pereira de Lucena, Alexandre A. Andreatta, Sergio E. R. de Carvalho, Celso C. Ribeiro:
Using UML-F to enhance framework development: a case study in the local search heuristics domain. J. Syst. Softw. 57(3): 201-206 (2001) - [j24]S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro:
Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38(1): 50-58 (2001) - 2000
- [j23]Marcelo Prais, Celso C. Ribeiro:
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment. INFORMS J. Comput. 12(3): 164-176 (2000) - [j22]Simone L. Martins, Mauricio G. C. Resende, Celso C. Ribeiro, Panos M. Pardalos:
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy. J. Glob. Optim. 17(1-4): 267-283 (2000) - [j21]Celso C. Ribeiro, Maurício C. de Souza:
Tabu search for the Steiner problem in graphs. Networks 36(2): 138-146 (2000) - [j20]Stella C. S. Porto, Joao Paulo Kitajima, Celso C. Ribeiro:
Performance evaluation of a parallel tabu search task scheduling algorithm. Parallel Comput. 26(1): 73-90 (2000)
1990 – 1999
- 1999
- [j19]Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza:
A new formulation for scheduling unrelated processor under precedence constraints. RAIRO Oper. Res. 33(1): 87-92 (1999) - [j18]Celso C. Ribeiro, Mauricio G. C. Resende:
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. 25(3): 341-352 (1999) - [c6]Alexandre Plastino, Celso C. Ribeiro, Noemi de La Rocque Rodriguez:
A tool for SPMD application development with support for load balancing. PARCO 1999: 639-646 - 1998
- [c5]Simone L. Martins, Celso C. Ribeiro, Maurício C. de Souza:
A Parallel GRASP for the Steiner Problem in Graphs. IRREGULAR 1998: 285-297 - [c4]Renata M. Aiex, Simone L. Martins, Celso C. Ribeiro, Noemi de La Rocque Rodriguez:
Cooperative Mult-thread Parallel Tabu Search with an Application to Circuit Partitioning. IRREGULAR 1998: 310-331 - [c3]Alexandre A. Andreatta, Sergio E. R. de Carvalho, Celso C. Ribeiro:
An Object-Oriented Framework for Local Search Heuristics. TOOLS (26) 1998: 33-45 - 1997
- [j17]Celso C. Ribeiro, Cláudio D. Ribeiro, Rosana S. G. Lanzelotte:
Query Optimization in Distributed Relational Databases. J. Heuristics 3(1): 5-23 (1997) - [j16]Mauricio G. C. Resende, Celso C. Ribeiro:
A GRASP for graph planarization. Networks 29(3): 173-189 (1997) - [c2]Simone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Greedy randomized adaptive search procedures for the Steiner problem in graphs. Randomization Methods in Algorithm Design 1997: 133-145 - [c1]Sérgio Lifschitz, Alexandre Plastino, Celso C. Ribeiro:
Exploring Load Balancing in Parallel Processing of Recursive Queries. Euro-Par 1997: 1125-1129 - 1996
- [j15]Stella C. S. Porto, Celso C. Ribeiro:
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints. J. Heuristics 1(2): 207-223 (1996) - 1995
- [j14]Stella C. S. Porto, Celso C. Ribeiro:
A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints. Int. J. High Speed Comput. 7(1): 45-71 (1995) - 1994
- [j13]Alexandre A. Andreatta, Celso C. Ribeiro:
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits. Ann. Oper. Res. 50(1): 1-36 (1994) - [j12]Cristina M. A. Leopoldino, Mario V. F. Pereira, Leontina M. V. Pinto, Celso C. Ribeiro:
A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning. Ann. Oper. Res. 50(1): 367-385 (1994) - [j11]Celso C. Ribeiro, Nelson Maculan:
Foreword. Ann. Oper. Res. 50(1) (1994) - [j10]Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro:
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing. Discret. Appl. Math. 50(3): 255-265 (1994) - [j9]Celso C. Ribeiro, François Soumis:
A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem. Oper. Res. 42(1): 41-52 (1994) - 1993
- [j8]Brigitte Jaumard, Marcelo Prais, Celso C. Ribeiro:
Penalty computations for the set partitioning problem. Ann. Oper. Res. 43(5): 285-293 (1993) - [j7]C. Carvalho de Souza, Celso C. Ribeiro:
Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study. Discret. Appl. Math. 45(3): 205-220 (1993) - 1991
- [j6]Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro:
Hyperbolic 0-1 programming and query optimization in information retrieval. Math. Program. 52: 255-263 (1991) - [j5]Mikhail J. Atallah, Celso C. Ribeiro, Sérgio Lifschitz:
Computing some distance functions between polygons. Pattern Recognit. 24(8): 775-781 (1991) - 1990
- [j4]Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro:
Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem. Ann. Math. Artif. Intell. 1: 97-109 (1990)
1980 – 1989
- 1989
- [j3]Pedro Cox, Henri Maître, Michel Minoux, Celso C. Ribeiro:
Optimal matching of convex polygons. Pattern Recognit. Lett. 9(5): 327-334 (1989) - 1985
- [j2]Celso C. Ribeiro, Michel Minoux:
A heuristic approach to hard constrained shortest path problems. Discret. Appl. Math. 10(2): 125-137 (1985) - 1984
- [j1]Celso C. Ribeiro:
Performance evaluation of vector implementations of combinatorial algorithms. Parallel Comput. 1(3-4): 287-294 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
