Artur Alves Pessoa

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 31

Top Venues

Pontifical Catholic University of Rio de Janeiro, Brazil (PHD)

Education History

Pontifical Catholic University of Rio de Janeiro, Brazil

PHD

Publications

Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian
Computing the worst-case due dates violations with budget uncertainty. Oper. Res. Lett. 56 (2024)
Marin Bougeret, Artur Alves Pessoa, Michael Poss
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51 (2) (2023)
Isaac Balster, Teobaldo Bulhões, Pedro Munari, Artur Alves Pessoa, Ruslan Sadykov
A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. Transp. Sci. 57 (5) (2023)
Karina Thiebaut, Artur Alves Pessoa
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization. 4OR 21 (3) (2023)
Artur Alves Pessoa, Teobaldo Bulhões, Vitor Nesello, Anand Subramanian
Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling. INFORMS J. Comput. 34 (3) (2022)
Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian, Artur Alves Pessoa
Iterated local search for single machine total weighted tardiness batch scheduling. J. Heuristics 27 (3) (2021)
Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. Transp. Sci. 55 (1) (2021)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa
Solving Bin Packing Problems Using VRPSolver Models. Oper. Res. Forum 2 (2) (2021)
Guilherme Henrique Ismael de Azevedo, Artur Alves Pessoa, Anand Subramanian
A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. Eur. J. Oper. Res. 289 (3) (2021)
Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. Oper. Res. 69 (3) (2021)
Daniel Oliveira, Artur Alves Pessoa
An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems. INFORMS J. Comput. 32 (1) (2020)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
A generic exact solver for vehicle routing and related problems. Math. Program. 183 (1) (2020)
Antonio Camargo Andrade de Araújo, Marcos Costa Roboredo, Artur Alves Pessoa, Valdecy Pereira
) hub-centroid problem. Comput. Oper. Res. 116 (2020)
Marcos Costa Roboredo, Artur Alves Pessoa, Luiz Aizemberg
An exact approach for the r-interdiction median problem with fortification. RAIRO Oper. Res. 53 (2) (2019)
Marcos Costa Roboredo, Luiz Aizemberg, Artur Alves Pessoa
An exact approach for the r-interdiction covering problem with fortification. Central Eur. J. Oper. Res. 27 (1) (2019)
Ruslan Sadykov, François Vanderbeck, Artur Alves Pessoa, Issam Tahiri, Eduardo Uchoa
Primal Heuristics for Branch and Price: The Assets of Diving Methods. INFORMS J. Comput. 31 (2) (2019)
Marin Bougeret, Artur Alves Pessoa, Michael Poss
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261 (2019)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO (2019)
Yuri Laio T. V. Silva, Anand Subramanian, Artur Alves Pessoa
Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Comput. Oper. Res. 90 (2018)
Hugo Quadros, Marcos Costa Roboredo, Artur Alves Pessoa
A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification. Expert Syst. Appl. 110 (2018)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. Eur. J. Oper. Res. 270 (2) (2018)
José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo
Integer programming formulations for three sequential discrete competitive location problems with foresight. Eur. J. Oper. Res. 265 (3) (2018)
Teobaldo Bulhões, Artur Alves Pessoa, Fábio Protti, Eduardo Uchoa
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. Oper. Res. Lett. 46 (4) (2018)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. INFORMS J. Comput. 30 (2) (2018)
Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa
Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9 (1) (2017)
Eduardo Uchoa, Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Thibaut Vidal, Anand Subramanian
New benchmark instances for the Capacitated Vehicle Routing Problem. Eur. J. Oper. Res. 257 (3) (2017)
Alexandre Domingues Gonçalves, Artur Alves Pessoa, Cristiana Bentes, Ricardo C. Farias, Lúcia Maria de A. Drummond
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique. INFORMS J. Comput. 29 (4) (2017)
Frederico Galaxe Paes, Artur Alves Pessoa, Thibaut Vidal
A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem. Eur. J. Oper. Res. 256 (3) (2017)
Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa, Haroldo G. Santos
Limited memory Rank-1 Cuts for Vehicle Routing Problems. Oper. Res. Lett. 45 (3) (2017)
Walton Pereira Coutinho, Roberto Quirino do Nascimento, Artur Alves Pessoa, Anand Subramanian
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem. INFORMS J. Comput. 28 (4) (2016)
Luiz Cláudio Sayão Cortez, Artur Alves Pessoa
A new model and a reformulation for the crude distillation unit charging problem with oil blends and sequence-dependent changeover costs. Comput. Chem. Eng. 84 (2016)
Juliana M. N. Silva, Cristina Boeres, Lúcia M. A. Drummond, Artur Alves Pessoa
Memory aware load balance strategy on a parallel branch-and-bound application. Concurr. Comput. Pract. Exp. 27 (5) (2015)
Antonio Eduardo Bier Longhi, Artur Alves Pessoa, Pauli Adriano de Almada Garcia
Multiobjective optimization of strategies for operation and testing of low-demand safety instrumented systems using a genetic algorithm and fault trees. Reliab. Eng. Syst. Saf. 142 (2015)
Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss
Robust constrained shortest path problems under budgeted uncertainty. Networks 66 (2) (2015)
Artur Alves Pessoa, Michael Poss
Robust Network Design with Uncertain Outsourcing Cost. INFORMS J. Comput. 27 (3) (2015)
Alexandre Domingues Gonçalves, Artur Alves Pessoa, Lúcia Maria de Assumpção Drummond, Cristiana Bentes, Ricardo C. Farias
Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique. CoRR (2015)
Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing. IPCO (2014)
Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa
Exact algorithms for the traveling salesman problem with draft limits. Eur. J. Oper. Res. 235 (1) (2014)
Luiz Aizemberg, Hugo Harry Kramer, Artur Alves Pessoa, Eduardo Uchoa
Formulations for a problem of petroleum transportation. Eur. J. Oper. Res. 237 (1) (2014)
Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa
The time dependent traveling salesman problem: polyhedra and algorithm. Math. Program. Comput. 5 (1) (2013)
Marcos Costa Roboredo, Artur Alves Pessoa
A branch-and-cut algorithm for the discrete (r∣p)-centroid problem. Eur. J. Oper. Res. 224 (1) (2013)
Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. SEA (2013)
Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim. Lett. 7 (7) (2013)
Juliana M. N. Silva, Cristina Boeres, Lúcia M. A. Drummond, Artur Alves Pessoa
Memory Aware Load Balance Strategy on a Parallel Branch-and-Bound Application CoRR (2013)
Alexandre Domingues Gonçalves, Lúcia Maria de A. Drummond, Artur Alves Pessoa, Peter M. Hahn
Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm CoRR (2013)
Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39 (5) (2011)
Artur Alves Pessoa, Peter M. Hahn, Monique Guignard, Yi-Rong Zhu
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. Eur. J. Oper. Res. 206 (1) (2010)
Hernán G. Abeledo, Ricardo Fukasawa, Artur Alves Pessoa, Eduardo Uchoa
The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. SEA (2010)
Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão, Rosiane de Freitas Rodrigues
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Math. Program. Comput. 2 (3-4) (2010)
Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54 (4) (2009)
Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. Math. Program. 112 (2) (2008)
Artur Alves Pessoa
A note on the construction of error detecting/correcting prefix codes. Inf. Process. Lett. 107 (1) (2008)
Artur Alves Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa
A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem. WEA (2007)
Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston de Souza
Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25 (4) (2007)
Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC (2004)
Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC (2004)
Artur Alves Pessoa
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks. ISAAC (2004)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
The complexity of makespan minimization for pipeline transportation. Theor. Comput. Sci. 306 (1-3) (2003)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Pipeline Transportation of Petroleum Products with No Due Dates. LATIN (2002)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31 (4) (2002)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
A strategy for searching with different access costs. Theor. Comput. Sci. 287 (2) (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX (2002)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Three space-economical algorithms for calculating minimum-redundancy prefix codes. IEEE Trans. Inf. Theory 47 (6) (2001)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
On binary searching with non-uniform costs. SODA (2001)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber, Raúl P. Rentería
Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. SPIRE (2000)
Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference (1999)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG (1999)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. SPIRE/CRIWG (1999)
Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
Bounding the Compression Loss of the FGK Algorithm. J. Algorithms 32 (2) (1999)
Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa
Bounding the Compression Loss of the FGK Algorithm. Data Compression Conference (1999)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. ALENEX (1999)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. Data Compression Conference (1999)
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
Strategies for Searching with Different Access Costs. ESA (1999)
Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
In-Place Length-Restricted Prefix Coding. SPIRE (1998)

Artur Alves Pessoa.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Artur Alves Pessoa