Artur Alves Pessoa
Artur Alves Pessoa
Professor de Engenharia de Produção, Universidade Federal Fluminense
Verified email at producao.uff.br
Title
Cited by
Cited by
Year
New benchmark instances for the capacitated vehicle routing problem
E Uchoa, D Pecin, A Pessoa, M Poggi, T Vidal, A Subramanian
European Journal of Operational Research 257 (3), 845-858, 2017
1502017
Improved branch-cut-and-price for capacitated vehicle routing
D Pecin, A Pessoa, M Poggi, E Uchoa
Mathematical Programming Computation 9 (1), 61-100, 2017
1412017
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
A Pessoa, E Uchoa, MP De Aragão, R Rodrigues
Mathematical Programming Computation 2 (3-4), 259-290, 2010
1012010
The time dependent traveling salesman problem: polyhedra and algorithm
H Abeledo, R Fukasawa, A Pessoa, E Uchoa
Mathematical Programming Computation 5 (1), 27-55, 2013
862013
A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem
A Pessoa, E Uchoa, M Poggi de Aragão
Networks: An International Journal 54 (4), 167-177, 2009
782009
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
A Subramanian, E Uchoa, AA Pessoa, LS Ochi
Operations Research Letters 39 (5), 338-341, 2011
702011
Robust branch-cut-and-price algorithms for vehicle routing problems
A Pessoa, MP De Aragao, E Uchoa
The vehicle routing problem: Latest advances and new challenges, 297-325, 2008
622008
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
E Uchoa, R Fukasawa, J Lysgaard, A Pessoa, MP De Aragao, D Andrade
Mathematical Programming 112 (2), 443-472, 2008
592008
A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
FG Paes, AA Pessoa, T Vidal
European Journal of Operational Research 256 (3), 742-756, 2017
582017
A branch-and-cut algorithm for the discrete (r∣ p)-centroid problem
MC Roboredo, AA Pessoa
European Journal of Operational Research 224 (1), 101-109, 2013
422013
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
A Subramanian, E Uchoa, AA Pessoa, LS Ochi
Optimization Letters 7 (7), 1569-1581, 2013
412013
Automation and combination of linear-programming based stabilization techniques in column generation
A Pessoa, R Sadykov, E Uchoa, F Vanderbeck
INFORMS Journal on Computing 30 (2), 339-360, 2018
382018
Algorithms for the cross-dock door assignment problem
M Guignard, PM Hahn, AA Pessoa, DC da Silva
Proceedings of the fourth international workshop on model-based …, 2012
362012
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
A Pessoa, MP De Aragão, E Uchoa
International Workshop on Experimental and Efficient Algorithms, 150-160, 2007
322007
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique
AA Pessoa, PM Hahn, M Guignard, YR Zhu
European Journal of Operational Research 206 (1), 54-63, 2010
282010
In-out separation and column generation stabilization by dual price smoothing
A Pessoa, R Sadykov, E Uchoa, F Vanderbeck
International Symposium on Experimental Algorithms, 354-365, 2013
272013
A branch-and-bound algorithm for the close-enough traveling salesman problem
WP Coutinho, RQ Nascimento, AA Pessoa, A Subramanian
INFORMS Journal on Computing 28 (4), 752-765, 2016
252016
Exact algorithms for the traveling salesman problem with draft limits
M Battarra, AA Pessoa, A Subramanian, E Uchoa
European Journal of Operational Research 235 (1), 115-128, 2014
252014
Robust constrained shortest path problems under budgeted uncertainty
A Alves Pessoa, L Di Puglia Pugliese, F Guerriero, M Poss
Networks 66 (2), 98-111, 2015
232015
Efficient implementation of the WARM-UP algorithm for the construction of length-restricted prefix codes
RL Milidiú, AA Pessoa, ES Laber
Workshop on Algorithm Engineering and Experimentation, 1-17, 1999
231999
The system can't perform the operation now. Try again later.
Articles 1–20