Celso C. Ribeiro
Orcid: 0000-0002-9478-2351Affiliations:
- Universidade Federal Fluminense, Brazil
According to our database1,
Celso C. Ribeiro
authored at least 155 papers
between 1984 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Red flag algorithms for Brazilian electronic invoices: outlier detection and price risk classification.
Int. Trans. Oper. Res., May, 2024
2023
Int. Trans. Oper. Res., November, 2023
Int. Trans. Oper. Res., November, 2023
Network polarization, filter bubbles, and echo chambers: an annotated review of measures and reduction methods.
Int. Trans. Oper. Res., November, 2023
Int. Trans. Oper. Res., July, 2023
RAIRO Oper. Res., May, 2023
Int. Trans. Oper. Res., 2023
2022
Maximum weighted induced forests and trees: new formulations and a computational comparative review.
Int. Trans. Oper. Res., 2022
Int. Trans. Oper. Res., 2022
The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study.
Inf. Sci., 2022
Network polarization, filter bubbles, and echo chambers: An annotated review of measures, models, and case studies.
CoRR, 2022
Comput. Oper. Res., 2022
2021
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy.
RAIRO Oper. Res., 2021
RAIRO Oper. Res., 2021
Int. Trans. Oper. Res., 2021
Polarization reduction by minimum-cardinality edge additions: Complexity and integer programming approaches.
Int. Trans. Oper. Res., 2021
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem.
Eur. J. Oper. Res., 2021
Biased random-key genetic algorithms using path-relinking as a progressive crossover strategy.
Proceedings of the ISMSI 2021: 2021 5th International Conference on Intelligent Systems, 2021
2020
A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model.
J. Glob. Optim., 2020
A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem.
Int. Trans. Oper. Res., 2020
Proceedings of the ISMSI '20: 2020 4th International Conference on Intelligent Systems, 2020
2019
Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax-and-fix heuristic.
Int. Trans. Oper. Res., 2019
Int. Trans. Oper. Res., 2019
2018
Eur. J. Oper. Res., 2018
2017
A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem.
Int. Trans. Oper. Res., 2017
A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems.
Int. Trans. Oper. Res., 2017
Formulations and heuristics for the multi-item uncapacitated lot-sizing problem with inventory bounds.
Int. J. Prod. Res., 2017
Curve and surface fitting by implicit polynomials: Optimum degree finding and heuristic refinement.
Comput. Graph., 2017
2016
J. Inf. Data Manag., 2016
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks.
J. Glob. Optim., 2016
Exact formulations for the minimum interference problem in <i>k</i>-connected <i>ad hoc</i> wireless networks.
Int. Trans. Oper. Res., 2016
Proceedings of the Genetic and Evolutionary Computation Conference, 2016
2015
tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms.
Optim. Lett., 2015
Int. Trans. Oper. Res., 2015
Int. Trans. Oper. Res., 2015
Int. Trans. Oper. Res., 2015
Improved solutions for the freight consolidation and containerization problem using aggregation and symmetry breaking.
Comput. Ind. Eng., 2015
2014
Applying software engineering techniques in the development and management of linear and integer programming applications.
Int. Trans. Oper. Res., 2014
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives.
Discret. Appl. Math., 2014
2013
Int. Trans. Oper. Res., 2013
Comput. Oper. Res., 2013
Power optimization in ad hoc wireless network topology control with biconnectivity requirements.
Comput. Oper. Res., 2013
Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.
Comput. Oper. Res., 2013
2012
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms.
J. Glob. Optim., 2012
Interfaces, 2012
J. Heuristics, 2012
Ann. Oper. Res., 2012
2011
J. Sched., 2011
J. Glob. Optim., 2011
A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications.
Int. Trans. Oper. Res., 2011
J. Heuristics, 2011
Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011
2010
J. Glob. Optim., 2010
Solving diameter-constrained minimum spanning tree problems by constraint programming.
Int. Trans. Oper. Res., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
IEEE Trans. Wirel. Commun., 2009
A hybrid genetic algorithm for the phylogeny problem using path-relinking as a progressive crossover strategy.
Int. Trans. Oper. Res., 2009
A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives.
Electron. Notes Discret. Math., 2009
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2009
New heuristics and integer programming formulations for scheduling divisible load tasks.
Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Scheduling, 2009
2008
A multi-agent framework to build integer programming applications to playoff elimination in sports tournaments.
Int. Trans. Oper. Res., 2008
A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints.
Eur. J. Oper. Res., 2008
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem.
Eur. J. Oper. Res., 2008
Electron. Notes Discret. Math., 2008
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008
2007
Uma Proposta de Framework para Desenvolvimento de Aplicações Paralelas com Mobilidade.
RITA, 2007
Parallel Comput., 2007
A tabu search approach for solving a difficult forest harvesting machine location problem.
Eur. J. Oper. Res., 2007
Comput. Commun., 2007
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy.
Proceedings of the Hybrid Metaheuristics, 4th International Workshop, 2007
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007
Proceedings of the Metaheuristics, 2007
2006
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem.
Discret. Appl. Math., 2006
Discret. Appl. Math., 2006
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
A Branch-and-Cut Algorithm for Scheduling the Highly-Constrained Chilean Soccer Tournament.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2005
Networks, 2005
Int. Trans. Oper. Res., 2005
An application of integer programming to playoff elimination in football championships.
Int. Trans. Oper. Res., 2005
A multistart constructive heuristic for sequencing by hybridization using adaptive memory.
Electron. Notes Discret. Math., 2005
Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005
2004
Parallel Process. Lett., 2004
J. Heuristics, 2004
Electron. Notes Discret. Math., 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Applications and Parallel Implementations of Metaheuristics in Network Design and Routing.
Proceedings of the Applied Computing, Second Asian Applied Computing Conference, 2004
2003
A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking.
Proceedings of the II Brazilian Workshop on Bioinformatics, 2003
Proceedings of the Handbook of Metaheuristics, 2003
2002
INFORMS J. Comput., 2002
J. Heuristics, 2002
Variable neighborhood search for the degree-constrained minimum spanning tree problem.
Discret. Appl. Math., 2002
Proceedings of the Euro-Par 2002, 2002
2001
Local search with perturbations for the prize-collecting Steiner tree problem in graphs.
Networks, 2001
Using UML-F to enhance framework development: a case study in the local search heuristics domain.
J. Syst. Softw., 2001
2000
Parallel Comput., 2000
A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy.
J. Glob. Optim., 2000
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment.
INFORMS J. Comput., 2000
1999
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP.
ACM Trans. Math. Softw., 1999
RAIRO Oper. Res., 1999
A tool for SPMD application development with support for load balancing.
Proceedings of the Parallel Computing: Fundamentals & Applications, 1999
1998
Proceedings of the TOOLS 1998: 26th International Conference on Technology of Object-Oriented Languages and Systems, 1998
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998
Cooperative Mult-thread Parallel Tabu Search with an Application to Circuit Partitioning.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1998
1997
Proceedings of the Euro-Par '97 Parallel Processing, 1997
Proceedings of the Randomization Methods in Algorithm Design, 1997
1996
Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints.
J. Heuristics, 1996
1995
A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints.
Int. J. High Speed Comput., 1995
1994
Oper. Res., 1994
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
Discret. Appl. Math., 1994
A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning.
Ann. Oper. Res., 1994
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits.
Ann. Oper. Res., 1994
1993
Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study.
Discret. Appl. Math., 1993
1991
Math. Program., 1991
1990
Ann. Math. Artif. Intell., 1990
1989
1985
Discret. Appl. Math., 1985
1984
Parallel Comput., 1984