#### Filter Results:

- Full text PDF available (105)

#### Publication Year

1984

2017

- This year (2)
- Last 5 years (28)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Publication Venue

#### 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)

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)

- 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)

- 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 adap-tive search procedure (GRASP), leading to significant improvements in solution time and quality. Path-relinking adds a memory mechanism to GRASP by providing an intensifi-cation strategy that explores trajectories connecting GRASP solutions and the best elite solutions previously… (More)

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

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 independent… (More)

- Sebastián Urrutia, Celso C. Ribeiro
- Discrete Applied Mathematics
- 2006

We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization problem are equivalent when the distance between every pair of teams is equal to 1. We show how to construct schedules with a maximum number of breaks for some tournament types.… (More)

A GRASP (Greedy Randomized Adaptive Search Procedure) is a metaheuris-tic for producing good-quality solutions of combinatorial optimization problems. It is usually implemented with a construction procedure based on a greedy randomized algorithm followed by local search. In this Chapter, we survey parallel implementations of GRASP. We describe simple… (More)

- Yuri Frota, Nelson Maculan, Thiago F. Noronha, Celso C. Ribeiro
- Networks
- 2010

- Celso C. Ribeiro
- 2000

In this paper we consider the labor constrained scheduling problem (LCSP), in which a set of jobs to be processed is subject to precedence and labor requirement constraints. Each job has a speciied processing time and a labor requirements proole, which typically varies as the job is processed. Given the amount of labor available at each period, the problem… (More)