Celso C. Ribeiro

According to our database1, Celso C. Ribeiro authored at least 136 papers between 1984 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A decision support system for fraud detection in public procurement.
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

2020
A heuristic for the minimum cost chromatic partition problem.
RAIRO Oper. Res., 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

Reducing Network Polarization by Edge Additions.
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

An exact algorithm for the maximum quasi-clique problem.
Int. Trans. Oper. Res., 2019

2018
Special issue on "Optimization and Machine Learning".
Int. Trans. Oper. Res., 2018

Extending time-to-target plots to multiple instances.
Int. Trans. Oper. Res., 2018

A biased random-key genetic algorithm for the maximum quasi-clique problem.
Eur. J. Oper. Res., 2018

An empirical investigation of network polarization.
Appl. Math. Comput., 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

Curve and surface fitting by implicit polynomials: Optimum degree finding and heuristic refinement.
Comput. Graph., 2017

2016
A Fast and Effective Strategy for Feature Selection in High-dimensional Datasets.
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

Heuristics for the generalized median graph problem.
Eur. J. Oper. Res., 2016

Edge coloring: A natural model for sports scheduling.
Eur. J. Oper. Res., 2016

Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial.
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

Preface to the Special Issue on Matheuristics: Model-Based Metaheuristics.
Int. Trans. Oper. Res., 2015

Preface to the Special Issue on Operations Research in Practice.
Int. Trans. Oper. Res., 2015

A biased random-key genetic algorithm for single-round divisible load scheduling.
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
Probabilistic stopping rules for GRASP heuristics and extensions.
Int. Trans. Oper. Res., 2013

Multi-start methods for combinatorial optimization.
Eur. J. Oper. Res., 2013

A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering.
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

Tutorials in Operations Research.
Int. Trans. Oper. Res., 2012

Sports scheduling: Problems and applications.
Int. Trans. Oper. Res., 2012

Scheduling the Brazilian Soccer Tournament: Solution Approach and Practice.
Interfaces, 2012

Path-relinking intensification methods for stochastic local search algorithms.
J. Heuristics, 2012

An ILS heuristic for the traveling tournament problem with predefined venues.
Ann. Oper. Res., 2012

2011
A heuristic for minimizing weighted carry-over effects in round robin tournaments.
J. Sched., 2011

Restart strategies for GRASP with path-relinking heuristics.
Optim. Lett., 2011

Experiments with LAGRASP heuristic for set <i>k</i>-covering.
Optim. Lett., 2011

A biased random-key genetic algorithm for routing and wavelength assignment.
J. Glob. Optim., 2011

A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications.
Int. Trans. Oper. Res., 2011

Adaptive memory in multistart heuristics for multicommodity network design.
J. Heuristics, 2011

Effective Probabilistic Stopping Rules for Randomized Metaheuristics: GRASP Implementations.
Proceedings of the Learning and Intelligent Optimization - 5th International Conference, 2011

2010
A branch-and-cut algorithm for partition coloring.
Networks, 2010

A hybrid heuristic for the diameter constrained minimum spanning tree problem.
J. Glob. Optim., 2010

Solving diameter-constrained minimum spanning tree problems by constraint programming.
Int. Trans. Oper. Res., 2010

Scheduling in sports: An annotated bibliography.
Comput. Oper. Res., 2010

2009
Graph Planarization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Optimal solutions for fault-tolerant topology control in wireless ad hoc networks.
IEEE Trans. Wirel. Commun., 2009

The traveling tournament problem with predefined venues.
J. Sched., 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

Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2008

Efficient Implementations of Heuristics for Routing and Wavelength Assignment.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
Uma Proposta de Framework para Desenvolvimento de Aplicações Paralelas com Mobilidade.
RITA, 2007

Efficient parallel cooperative implementations of GRASP heuristics.
Parallel Comput., 2007

TTT plots: a perl program to create time-to-target plots.
Optim. Lett., 2007

Letter from the Editor.
Int. Trans. Oper. Res., 2007

Heuristics for the mirrored traveling tournament problem.
Eur. J. Oper. Res., 2007

A tabu search approach for solving a difficult forest harvesting machine location problem.
Eur. J. Oper. Res., 2007

Metaheuristics for optimization problems in computer communications.
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

A New Lower Bound to the Traveling Tournament Problem.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

Exploring Grid Implementations of Parallel Cooperative Metaheuristics.
Proceedings of the Metaheuristics, 2007

2006
Routing and wavelength assignment by partition colouring.
Eur. J. Oper. Res., 2006

Maximizing breaks and bounding solutions to the mirrored traveling tournament problem.
Discret. Appl. Math., 2006

Preface.
Discret. Appl. Math., 2006

Multiprocessor scheduling under precedence constraints: Polyhedral results.
Discret. Appl. Math., 2006

Scheduling workover rigs for onshore oil production.
Discret. Appl. Math., 2006

Scheduling the Brazilian Soccer Tournament with Fairness and Broadcast Objectives.
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

Referee Assignment in Sports Leagues.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

Metaheuristics and Applications to Optimization Problems in Telecommunications.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing.
Networks, 2005

Preface.
ACM J. Exp. Algorithmics, 2005

A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure.
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
Automatic Scheduling Of Hypermedia Documents With Elastic Times.
Parallel Process. Lett., 2004

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem.
J. Heuristics, 2004

Minimizing Travels by Maximizing Breaks in Round Robin Tournament Schedules.
Electron. Notes Discret. Math., 2004

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

A Randomized Heuristic for Scene Recognition by Graph Matching.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling.
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
Developing SPMD applications with load balancing.
Parallel Comput., 2003

A GRASP with path-relinking for private virtual circuit routing.
Networks, 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

Greedy Randomized Adaptive Search Procedures.
Proceedings of the Handbook of Metaheuristics, 2003

2002
Preprocessing Steiner problems from VLSI layout.
Networks, 2002

A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.
INFORMS J. Comput., 2002

Heuristics for the Phylogeny Problem.
J. Heuristics, 2002

Probability Distribution of Solution Time in GRASP: An Experimental Investigation.
J. Heuristics, 2002

Variable neighborhood search for the degree-constrained minimum spanning tree problem.
Discret. Appl. Math., 2002

A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note).
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
Performance evaluation of a parallel tabu search task scheduling algorithm.
Parallel Comput., 2000

Tabu search for the Steiner problem in graphs.
Networks, 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

A new formulation for scheduling unrelated processor under precedence constraints.
RAIRO Oper. Res., 1999

A tool for SPMD application development with support for load balancing.
Proceedings of the Parallel Computing: Fundamentals & Applications, 1999

1998
An Object-Oriented Framework for Local Search Heuristics.
Proceedings of the TOOLS 1998: 26th International Conference on Technology of Object-Oriented Languages and Systems, 1998

A Parallel GRASP for the Steiner Problem in Graphs.
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
A GRASP for graph planarization.
Networks, 1997

Query Optimization in Distributed Relational Databases.
J. Heuristics, 1997

Exploring Load Balancing in Parallel Processing of Recursive Queries.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Greedy randomized adaptive search procedures for the Steiner problem in graphs.
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
A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem.
Oper. Res., 1994

A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
Discret. Appl. Math., 1994

Foreword.
Ann. Oper. Res., 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

Penalty computations for the set partitioning problem.
Ann. Oper. Res., 1993

1991
Computing some distance functions between polygons.
Pattern Recognit., 1991

Hyperbolic 0-1 programming and query optimization in information retrieval.
Math. Program., 1991

1990
Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem.
Ann. Math. Artif. Intell., 1990

1989
Optimal matching of convex polygons.
Pattern Recognit. Lett., 1989

1985
A heuristic approach to hard constrained shortest path problems.
Discret. Appl. Math., 1985

1984
Performance evaluation of vector implementations of combinatorial algorithms.
Parallel Comput., 1984


  Loading...