Main Publications


Working Papers

  1. G. Belov,  Letchford and E. Uchoa, A node-flow model for 1D stock cutting: robust branch-cut-and-price, Tech. Report RPEP n.7, Vol.5, Universidade Federal Fluminense, 2005 [pdf]
  2. M. Poggi de Aragão and E. Uchoa, Integer program reformulation for robust branch-and-cut-and-price, 2003 [pdf]

 

Journal Articles

  1. E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi de Aragão and D. Andrade, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, Mathematical Programming, to appear.
  2. L. Drummond, E. Uchoa, A. Gonçalves, J. Silva, M. Santos and C. Castro, A grid-enabled distributed branch-and-bound algorithm with application on the Steiner problem in graphs, Parallel Computing, to appear.
  3. R. Fukasawa, H. Longo, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa and R.F. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, Vol. 106,  pp. 491-511, 2006.
  4. E. Uchoa, Reduction Tests for the Prize-Collecting Steiner Problem, Operations Research Letters, Vol. 34, pp. 437-444, 2006.
  5. H. Longo, M. Poggi de Aragão and E.Uchoa. Solving Capacitated Arc Routing Problems using a transformation to the CVRP, Computers & Operations Research, Vol. 33, pp. 1823-1837, 2006.  [Tech. report]
  6. E. Uchoa, M. Poggi de Aragão and C.C. Ribeiro. Preprocessing Steiner problems from VLSI layout, Networks, Vol. 40, pp. 38-50, 2002.  [abstract] [ps]
  7. C.C. Ribeiro, E. Uchoa and R.F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs, INFORMS Journal on Computing, Vol. 14, pp. 228-246, 2002.  [abstract] [ps]
  8. E. Uchoa and M. Poggi de Aragão. Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut,  Mathematical Programming,  Vol. 90, pp. 537-557, 2001. [abstract] [ps]
  9. M. Poggi de Aragão and E. Uchoa , The gamma-connected assignment problem, European Jounal of Operational Research, Vol. 118, pp.127-138, 1999. [abstract] [ps]

 

Some Conference Proceedings

  1. L. Moreno, M. Poggi de Aragão and E. Uchoa, Column generation based heuristics for a helicopter routing problem. Workshop on Experimental Algorithms, Lecture Notes in Computer Science, Vol. 4007. pp. 219-230, 2006.
  2. A. Pigatti, M. Poggi de Aragão and E.Uchoa, Stabilized branch-and-cut-and-price for the generalized assigment problem, 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics,  Electronic Notes in Discrete Mathematics, Vol. 19, pp. 385-395, 2005. [Tech.report]
  3. R. Fukasawa, J. Lysgaard, M. Poggi de Aragão, M. Reis, E. Uchoa and R.F. Werneck, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Proceedings of the tenth Integer Programming and Combinatorial Optimization conference IPCO'04, New York, Lecture Notes in Computer Science, Vol.3064  pp.1-15, 2004.
  4. R. Fukasawa, M. Poggi de Aragão, O. Porto and E. Uchoa, Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem, Proceedings of the International Network Optmization Conference, pp. 231-236,  Evry, France,  2003.
  5. R. Fukasawa, M. Poggi de Aragão, O. Porto and E. Uchoa, Solving the freight car flow problem to optimality, Proceedings of the ATMOS 2002, Malaga, Spain, Electronic Notes in Theoretical Computer Science, Vol.6, 11 pp., Elsevier, 2002. [abstract] [ps]
  6. I. Rosseti, M. Poggi de Aragão, C.C. Ribeiro, E. Uchoa and R.F. Werneck, New benchmark instances for the Steiner problem in graphs, Extended Abstracts of the 4th Metaheuristics International Conference, pp. 557-561, Porto, Portugal, 2001. [ps]  (The instances are available at Steinlib).
  7. M. Poggi de Aragão, C.C. Ribeiro, E. Uchoa and R.F. Werneck, Hybrid Local Search for the Steiner problem in graphs, Extended Abstracts of the 4th Metaheuristics International Conference, pp. 429-433, Porto, Portugal, 2001. [ps]
  8. M. Poggi de Aragão, E. Uchoa and R.F. Werneck, Dual heuristics on the exact solution of large Steiner problems, Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics GRACO, Fortaleza, Electronic Notes in Discrete Mathematics Vol.7, 5 pp., Elsevier, 2001. [abstract] [ps]
  9. E. Uchoa and M. Poggi de Aragão. Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut, Proceedings of the seventh Integer Programming and Combinatorial Optimization conference IPCO'99, Graz, Lecture Notes in Computer Science, Vol.1610  pp.439-452, 1999.  [abstract] [ps]

 

Ph.D. Thesis (in portuguese)

·  Algoritmos para problemas de Steiner com aplicações em projeto de circuitos VLSI. Tese defendida dia 4 de maio, versão corrigida, PUC-RIO, maio 2001. [resumo] [abstract] [ps]

 

Back