#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1999

2018

- This year (2)
- Last 5 years (35)
- Last 10 years (64)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

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

Abstract. The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents anâ€¦ (More)

Computing driving directions has motivated many shortest path heuristics that answer queries on continental scale networks, with tens of millions of intersections, literally instantly, and with veryâ€¦ (More)

- Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
- ALENEX
- 2006

We study the point-to-point shortest path problem in a setting where preprocessing is allowed. We improve the reach-based approach of Gutman [17] in several ways. In particular, we introduce aâ€¦ (More)

Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highwayâ€¦ (More)

- Andrew V. Goldberg, Renato F. Werneck
- ALENEX/ANALCO
- 2005

We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of road networks. We suggest improvements to the algorithm itself and to its preprocessing stage. We alsoâ€¦ (More)

We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labelingâ€¦ (More)

- Mauricio G. C. Resende, Renato F. Werneck
- European Journal of Operational Research
- 2006

We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show extensive empiricalâ€¦ (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 multistart approach, the greedy randomizedâ€¦ (More)

- Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
- 2011 IEEE International Parallel & Distributedâ€¦
- 2011

We present a novel approach to graph partitioning based on the notion of \emph{natural cuts}. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cutâ€¦ (More)