Home Vita Publications Courses Software Links

Below is a list of recent publications, some of which are available for download in one or more formats (click on their titles to see which ones). You may need to download a (free) viewer for djvu or ps files. Send me a message if you need a particular file in some other format.


Journal Publications

  1. Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem, with R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, and E. Uchoa. Mathematical Programming, volume 106, number 3, pp. 491-511, 2006.

  2. Finding Dominators in Practice, with L. Georgiadis and R. E. Tarjan. Journal of Graph Algorithms and Applications, volume 10, no.1, pp. 69-94, 2006.

  3. A hybrid multistart heuristic for the uncapacitated facility location problem, with M. G. C. Resende. European Journal of Operations Research, to appear.

  4. A fast swap-based local search procedure for location problems, with M. G. C. Resende. Annals of Operations Research, to appear.

  5. A hybrid heuristic for the p-median problem, with M. G. C. Resende. Journal of Heuristics, volume 10, number 1, pp. 59-88, 2004.

  6. New benchmark instances for the Steiner problem in graphs, with I. Rosseti, M. Poggi de Aragão, C. C. Ribeiro, and E. Uchoa. In Metaheuristics: Computer Decision-Making (M. G. C. Resende and J. Souza, editors), pp. 601-614, Kluwer, 2003.

  7. A hybrid GRASP with perturbations for the Steiner problem in graphs, with C. C. Ribeiro and E. Uchoa. INFORMS Journal on Computing, volume 14, number 3, pp. 228-246, 2002.

  8. Finding minimum congestion spanning trees, with J. C. Setubal. ACM Journal of Experimental Algorithmics, volume 5, 2000.


Conference Proceedings

  1. Shortest Path Feasibility Algorithms: An Experimental Evaluation, with B. V. Cherkassky, Loukas Georgiadis, A. V. Goldberg, and R. E. Tarjan. Proceeding of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), San Francisco, California, 2008.

  2. Dynamic Trees in Practice, with R. E. Tarjan. Proceeding of the 6th Workshop on Experimental Algorithms (WEA 2007), pp. 80-93, Rome, Italy, 2007.

  3. Better Landmarks Within Reach, with A. V. Goldberg and Haim Kaplan. Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), pp. 38-51, Rome, Italy, 2007.

  4. Design of Data Structures for Mergeable Trees, with L. Georgiadis R. E. Tarjan. Proceeding of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 813-882, Miami, Florida, 2006.

  5. Reach for A*: Efficient Point-to-Point Shortest Path Algorithms, with A. V. Goldberg and Haim Kaplan. Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), Miami, Florida, 2006.

  6. Computing Point-to-Point Shortest Paths from External Memory, with A. V. Goldberg. Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments (ALENEX'05), Vancouver, Canada, 2005.

  7. Self-Adjusting Top Trees, with R. E. Tarjan. Proceeding of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 813-882, Vancouver, Canada, 2005.

  8. Finding Dominators in Practice, with L. Georgiadis, R. E. Tarjan, S. Triantafyllis, and D. August. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA 2004), Bergen, Norway, Lecture Notes in Computer Science, volume 3221, pp. 677-688, Springer-Verlag, 2004.

  9. Robust branch-and-cut-and-price for the Capacitated Vehicle Routing Problem, with R. Fukasawa, J. Lysgaard, M. Poggi de Aragão, M. Reis, and E. Uchoa. In Integer Programming and Combinatorial Optimization - 10th International IPCO Conference, New York, Lecture Notes in Computer Science, volume 3064, pp. 1-15, Springer-Verlag, 2004.

  10. On the implementation of a swap-based local search procedure for the p-median problem, with M. G. C. Resende. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX'03), Richard E. Ladner (Ed.), SIAM, Philadelphia, pp. 119-127, 2003.

  11. On the implementation of MST-based heuristics for the Steiner problem in graphs, with M. Poggi de Aragão. Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02), San Francisco, Lecture Notes in Computer Science, volume 2409, pp. 1-15, Springer-Verlag, 2002.

  12. Hybrid local search for the Steiner problem in graphs, with M. Poggi de Aragão, C. C. Ribeiro, and E. Uchoa. Extended Abstracts of the 4th Metaheuristics International Conference (MIC 2001), pp. 429-433, Porto, Portugal, 2001.

  13. New benchmark instances for the Steiner problem in graphs, with I. Rosseti, M. Poggi de Aragão, C. C. Ribeiro, and E. Uchoa. Extended Abstracts of the 4th Metaheuristics International Conference (MIC 2001), pp. 557-561, Porto, Portugal, 2001.

  14. Dual heuristics on the exact solution of large Steiner problems, with M. Poggi de Aragão and E. Uchoa. Extended abstract in Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO), Fortaleza, Brazil, Electronic Notes in Discrete Mathematics, volume 7, Elsevier, 2001.

  15. A hybrid GRASP with perturbations and adaptive path-relinking for the Steiner problem in graphs, with C. C. Ribeiro and E. Uchoa. Proceedings of the Workshop on Algorithm Engineering as a New Paradigm, pp. 76-116, Kyoto University, Japan, 2000.

  16. Finding minimum congestion spanning trees, with J. C. Setubal and A. F. Conceição. Proceedings of the Third Workshop on Algorithm Engineering (WAE'99), King's College, London, Lecture Notes in Computer Science, volume 1668, pp. 60-71, Springer-Verlag, 1999.


Other Publications

  1. Design and Analysis of Data Structures for Dynamic Trees. PhD Thesis, Princeton University, 2006.

  2. A hybrid multistart heuristic for the uncapacitated facility location problem, with M. G. C. Resende. Technical Report TD-5RELRR, AT&T Labs Research, 2003.

  3. A hybrid heuristic for the p-median problem, with M. G. C. Resende. Technical Report TD-5NWRCR, AT&T Labs Research, 2003.

  4. A GRASP with path-relinking for the p-median problem, with M. G. C. Resende. Technical Report TD-5E53XL, AT&T Labs Research, 2002.

  5. Problema de Steiner em Grafos: Algoritmos Primais, Duais e Exatos. Master's Thesis, Department of Informatics, PUC-Rio, 2001 (in Portuguese).
    (Title in English: Steiner Problem in Graphs: Primal, Dual, and Exact Algorithms.)

  6. A program for building contig scaffolds in double-barreled shotgun genome sequencing, with J. C. Setubal. Technical Report IC-01-05, Institute of Computing, Unicamp, 2001.

  7. Dual heuristics on the exact solution of large Steiner problems, with D. Andrade, M. Poggi de Aragão, and E. Uchoa. Abstract in Proceedings of the 17th International Symposium on Mathematical Programming (ISMP 2000), Georgia Institute of Technology, Atlanta, USA, 2000.

  8. Sorting methods for small arrays, with C. C. Ribeiro. PUC-Rio Department of Informatics Technical Report MCC 23-00, 2000.

Last updated on August 31, 2008 home