#### Filter Results:

#### Publication Year

1984

2016

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

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

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)

- Celso C. Ribeiro, Eduardo Uchoa, Renato F. Werneck
- INFORMS Journal on Computing
- 2002

We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the combination of several construction heuristics with a weight perturbation strategy that combines… (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
- Optimization Letters
- 2007

This papers describes a perl language program to create time-to-target solution value plots for measured CPU times that are assumed to fit a shifted exponential distribution. This is often the case in local search based heuristics for combinatorial optimization , such as simulated annealing, genetic algorithms, iterated local search, tabu search, WalkSAT,… (More)

- Celso C. Ribeiro, François Soumis
- Operations Research
- 1994

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

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)

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