Artur Alves Pessoa

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