#### Filter Results:

- Full text PDF available (112)

#### Publication Year

1984

2017

- This year (3)
- Last 5 years (31)
- Last 10 years (76)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Marcelo Prais, Celso C. Ribeiro
- INFORMS Journal on Computing
- 2000

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for a matrix decomposition problem arising in the context of traac assignment in communication satellites. We review basic concepts of GRASP: construction and local search algorithms. The local search phase is based on… (More)

- S. A. Canuto, Mauricio G. C. Resende, Celso C. Ribeiro
- Networks
- 2001

Given an undirected graph with prizes associated with its nodes and weights associated with its edges, the prize-collecting Steiner tree problem consists in finding a subtree of this graph which minimizes the sum of the weights of its edges plus the prizes of the nodes not spanned. In this paper, we describe a multi-start local search algorithm for the… (More)

Path-relinking is a major enhancement to the basic greedy randomized adaptive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensification strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously… (More)

- Adriana C. F. Alvim, Celso C. Ribeiro, Fred Glover, Dario J. Aloise
- J. Heuristics
- 2004

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement… (More)

- Luciana S. Buriol, Mauricio G. C. Resende, Celso C. Ribeiro, Mikkel Thorup
- Networks
- 2005

Intra-domain traffic engineering aims to make more efficient use of network resources within an autonomous system. Interior Gateway Protocols such as OSPF (Open Shortest Path First) and IS-IS (Intermediate SystemIntermediate System) are commonly used to select the paths along which traffic is routed within an autonomous system. These routing protocols… (More)

GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the… (More)

- Stella C. S. Porto, Celso C. Ribeiro
- International Journal of High Speed Computing
- 1995

Parallel programs may be represented as a set of interrelated sequential tasks. When multiproces-sors are used to execute such programs, the parallel portion of the application can be speeded up by an appropriate allocation of processors to the tasks of the application. Given a parallel application deened by a task precedence graph, the goal of task… (More)

- Renata M. Aiex, Mauricio G. C. Resende, Celso C. Ribeiro
- J. Heuristics
- 2002

Abstract. A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a sub-optimal target value in five GRASPs that have appeared in the literature and for which source code is available. The distributions are estimated by running 12,000… (More)

- Celso C. Ribeiro, Sebastián Urrutia
- European Journal of Operational Research
- 2007

Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poor schedules of games. Game scheduling is a difficult task, involving several decision makers, different types of constraints, and multiple objectives to optimize. The Traveling… (More)

- Alexandre A. Andreatta, Celso C. Ribeiro
- J. Heuristics
- 2002

A phylogeny is a tree that relates taxonomic units, based on their similarity over a set of characters. The problem of nding a phylogeny with the minimum number of evolutionary steps is one of the main problems in comparative biology. In this work, we study diierent heuristic approaches to the phylogeny problem under the parsimony criterion. New algorithms… (More)