#### Filter Results:

- Full text PDF available (117)

#### Publication Year

1986

2019

- This year (5)
- Last 5 years (43)
- Last 10 years (121)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thomas A. Feo, Mauricio G. C. Resende
- J. Global Optimization
- 1995

GRASP (greedy randomized adaptive search procedure) is a metaheuristic for combinatorial optimization. GRASP usually is implemented as a multistart procedure, where each iteration is made up of aâ€¦ (More)

- Mauricio G. C. Resende, Renato F. Werneck
- J. Heuristics
- 2004

Given n customers and a set F of m potential facilities, the p-median problem consists in finding a subset of F with p facilities such that the cost of serving all customers is minimized. This is aâ€¦ (More)

- JosÃ© Fernando GonÃ§alves, Mauricio G. C. Resende
- J. Heuristics
- 2011

- JosÃ© Fernando GonÃ§alves, Jorge JosÃ© de MagalhÃ£es Mendes, Mauricio G. C. Resende
- European Journal of Operational Research
- 2005

This paper presents a hybrid genetic algorithm for the job shop scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using aâ€¦ (More)

- Renata M. Aiex, S. Binato, Mauricio G. C. Resende
- Parallel Computing
- 2003

In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation isâ€¦ (More)

- JosÃ© Fernando GonÃ§alves, Mauricio G. C. Resende
- Computers & Industrial Engineering
- 2004

Cellular manufacturing emerged as a production strategy capable of solving the certain problems of complexity and long manufacturing lead times in batch production. The fundamental problem inâ€¦ (More)

- James Abello, Mauricio G. C. Resende, Sandra Sudarsky
- LATIN
- 2002

We describe techniques that are useful for the detection of dense subgraphs (quasi-cliques) in massive sparse graphs whose vertex set, but not the edge set, fits in RAM. The algorithms rely onâ€¦ (More)

- Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, C. C. Ribeiro
- Optimization Methods and Software
- 2002

Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints inâ€¦ (More)

- Mauricio G. C. Resende, Rafael MartÃ, Micael Gallego, Abraham Duarte
- Computers & OR
- 2010

The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The problem is NP-hard andâ€¦ (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â€¦ (More)