#### Filter Results:

#### Publication Year

1984

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

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)

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)

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

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

Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe an improved tabu search algorithm for the Steiner problem in graphs, based on a neighborhood deened by insertions and… (More)

- Mauricio G C Resende, Celso C Ribeiro
- 2004

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)

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)