|
Search the dblp DataBase
Renato Fonseca F. Werneck:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mauricio G. C. Resende, Renato Fonseca F. Werneck
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem. [Citation Graph (0, 0)][DBLP] ALENEX, 2003, pp:119-127 [Conf]
- Marcus Poggi de Aragão, Renato Fonseca F. Werneck
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP] ALENEX, 2002, pp:1-15 [Conf]
- Andrew V. Goldberg, Renato Fonseca F. Werneck
Computing Point-to-Point Shortest Paths from External Memory. [Citation Graph (0, 0)][DBLP] ALENEX/ANALCO, 2005, pp:26-40 [Conf]
- Loukas Georgiadis, Renato Fonseca F. Werneck, Robert Endre Tarjan, Spyridon Triantafyllis, David I. August
Finding Dominators in Practice. [Citation Graph (0, 0)][DBLP] ESA, 2004, pp:677-688 [Conf]
- Ricardo Fukasawa, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:1-15 [Conf]
- Loukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck
Design of data structures for mergeable trees. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:394-403 [Conf]
- Robert Endre Tarjan, Renato Fonseca F. Werneck
Self-adjusting top trees. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:813-822 [Conf]
- Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição
Finding Minimum Congestion Spanning Trees. [Citation Graph (0, 0)][DBLP] Algorithm Engineering, 1999, pp:60-71 [Conf]
- Mauricio G. C. Resende, Renato Fonseca F. Werneck
A Hybrid Heuristic for the p-Median Problem. [Citation Graph (0, 0)][DBLP] J. Heuristics, 2004, v:10, n:1, pp:59-88 [Journal]
- Celso C. Ribeiro, Eduardo Uchoa, Renato Fonseca F. Werneck
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2002, v:14, n:3, pp:228-246 [Journal]
- Renato Fonseca F. Werneck, João C. Setubal
Finding Minimum Congestion Spanning Trees. [Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:11- [Journal]
- Ricardo Fukasawa, Humberto Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo Reis, Eduardo Uchoa, Renato Fonseca F. Werneck
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP] Math. Program., 2006, v:106, n:3, pp:491-511 [Journal]
- Mauricio G. C. Resende, Renato Fonseca F. Werneck
A hybrid multistart heuristic for the uncapacitated facility location problem. [Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:174, n:1, pp:54-68 [Journal]
- Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F. Werneck
Better Landmarks Within Reach. [Citation Graph (0, 0)][DBLP] WEA, 2007, pp:38-51 [Conf]
- Robert Endre Tarjan, Renato Fonseca F. Werneck
Dynamic Trees in Practice. [Citation Graph (0, 0)][DBLP] WEA, 2007, pp:80-93 [Conf]
An Experimental Study of Minimum Mean Cycle Algorithms. [Citation Graph (, )][DBLP]
Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP]
Fast Local Search for Steiner Trees in Graphs. [Citation Graph (, )][DBLP]
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]
Virtual Ring Routing Trends. [Citation Graph (, )][DBLP]
Fast Local Search for the Maximum Independent Set Problem. [Citation Graph (, )][DBLP]
Alternative Routes in Road Networks. [Citation Graph (, )][DBLP]
Data Structures for Mergeable Trees [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|