2009 |
23 | EE | Loukas Georgiadis,
Andrew V. Goldberg,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
An Experimental Study of Minimum Mean Cycle Algorithms.
ALENEX 2009: 1-13 |
2008 |
22 | EE | Boris V. Cherkassky,
Loukas Georgiadis,
Andrew V. Goldberg,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Shortest Path Feasibility Algorithms: An Experimental Evaluation.
ALENEX 2008: 118-132 |
21 | EE | Diogo Viera Andrade,
Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
Fast Local Search for the Maximum Independent Set Problem.
WEA 2008: 220-234 |
20 | EE | Renato Fonseca F. Werneck:
Dynamic Trees.
Encyclopedia of Algorithms 2008 |
2007 |
19 | EE | Andrew V. Goldberg,
Haim Kaplan,
Renato Fonseca F. Werneck:
Better Landmarks Within Reach.
WEA 2007: 38-51 |
18 | EE | Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Dynamic Trees in Practice.
WEA 2007: 80-93 |
17 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A fast swap-based local search procedure for location problems.
Annals OR 150(1): 205-230 (2007) |
16 | EE | Loukas Georgiadis,
Haim Kaplan,
Nira Shafrir,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Data Structures for Mergeable Trees
CoRR abs/0711.1682: (2007) |
2006 |
15 | EE | Loukas Georgiadis,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Design of data structures for mergeable trees.
SODA 2006: 394-403 |
14 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A hybrid multistart heuristic for the uncapacitated facility location problem.
European Journal of Operational Research 174(1): 54-68 (2006) |
13 | EE | Loukas Georgiadis,
Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Finding Dominators in Practice.
J. Graph Algorithms Appl. 10(1): 69-94 (2006) |
12 | EE | 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.
Math. Program. 106(3): 491-511 (2006) |
2005 |
11 | EE | Andrew V. Goldberg,
Renato Fonseca F. Werneck:
Computing Point-to-Point Shortest Paths from External Memory.
ALENEX/ANALCO 2005: 26-40 |
10 | EE | Robert Endre Tarjan,
Renato Fonseca F. Werneck:
Self-adjusting top trees.
SODA 2005: 813-822 |
2004 |
9 | EE | Loukas Georgiadis,
Renato Fonseca F. Werneck,
Robert Endre Tarjan,
Spyridon Triantafyllis,
David I. August:
Finding Dominators in Practice.
ESA 2004: 677-688 |
8 | EE | 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.
IPCO 2004: 1-15 |
7 | EE | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
A Hybrid Heuristic for the p-Median Problem.
J. Heuristics 10(1): 59-88 (2004) |
2003 |
6 | | Mauricio G. C. Resende,
Renato Fonseca F. Werneck:
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
ALENEX 2003: 119-127 |
2002 |
5 | EE | Marcus Poggi de Aragão,
Renato Fonseca F. Werneck:
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.
ALENEX 2002: 1-15 |
4 | EE | Celso C. Ribeiro,
Eduardo Uchoa,
Renato Fonseca F. Werneck:
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs.
INFORMS Journal on Computing 14(3): 228-246 (2002) |
2001 |
3 | EE | Marcus Poggi de Aragão,
Eduardo Uchoa,
Renato Fonseca F. Werneck:
Dual Heuristics on the Exact Solution of Large Steiner Problems.
Electronic Notes in Discrete Mathematics 7: 150-153 (2001) |
2000 |
2 | EE | Renato Fonseca F. Werneck,
João C. Setubal:
Finding Minimum Congestion Spanning Trees.
ACM Journal of Experimental Algorithmics 5: 11 (2000) |
1999 |
1 | EE | Renato Fonseca F. Werneck,
João C. Setubal,
Arlindo Flávio da Conceição:
Finding Minimum Congestion Spanning Trees.
Algorithm Engineering 1999: 60-71 |