In-Place Length-Restricted Prefix Coding. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (SPIRE, 1998)

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (ALENEX, 1999)

A Work Efficient Parallel Algorithm for Constructing Huffman Codes. - Ruy Luiz Milidiú; Eduardo Sany Laber; Artur Alves Pessoa (Data Compression Conference, 1999)

Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (Data Compression Conference, 1999)

Strategies for Searching with Different Access Costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (ESA, 1999)

Practical Constructions of L-restricted Alphabetic Prefix Codes. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SPIRE/CRIWG, 1999)

A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (SPIRE/CRIWG, 1999)

Bounding the Compression Loss of the FGK Algorithm. - Ruy Luiz Milidiú; Eduardo Sany Laber; Artur Alves Pessoa (J. Algorithms, 1999)

Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber; Raúl P. Rentería (SPIRE, 2000)

On binary searching with non-uniform costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SODA, 2001)

Three space-economical algorithms for calculating minimum-redundancy prefix codes. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (IEEE Trans. Inf. Theory, 2001)

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (APPROX, 2002)

Pipeline Transportation of Petroleum Products with No Due Dates. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (LATIN, 2002)

On Binary Searching with Nonuniform Costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (SIAM J. Comput., 2002)

A strategy for searching with different access costs. - Eduardo Sany Laber; Ruy Luiz Milidiú; Artur Alves Pessoa (Theor. Comput. Sci., 2002)

The complexity of makespan minimization for pipeline transportation. - Ruy Luiz Milidiú; Artur Alves Pessoa; Eduardo Sany Laber (Theor. Comput. Sci., 2003)

Dois problemas de OtimizaçãO EM Grafos: Transporte EM Redes de Dutos E Busca com Custos de Acessos. - Artur Alves Pessoa (2003)

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. - Artur Alves Pessoa; Eduardo Sany Laber; Críston P. de Souza (ALENEX/ANALC, 2004)

Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks. - Artur Alves Pessoa (ISAAC, 2004)

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. - Artur Alves Pessoa; Eduardo Sany Laber; Críston P. de Souza (ISAAC, 2004)

Reducing human interactions in Web directory searches. - Ornan Ori Gerstel; Shay Kutten; Eduardo Sany Laber; Rachel Matichin; David Peleg; Artur Alves Pessoa; Críston P. de Souza (ACM Trans. Inf. Syst., 2007)

A note on the construction of error detecting/correcting prefix codes. - Artur Alves Pessoa (Inf. Process. Lett., 2008)

Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation. - Eduardo Uchoa; Ricardo Fukasawa; Jens Lysgaard; Artur Alves Pessoa; Marcus Poggi de Aragão; Diogo Andrade (Math. Program., 2008)

A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. - Artur Alves Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão (Networks, 2009)

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. - Hernán G. Abeledo; Ricardo Fukasawa; Artur Alves Pessoa; Eduardo Uchoa (SEA, 2010)

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. - Artur Alves Pessoa; Peter M. Hahn; Monique Guignard 001; Yi-Rong Zhu (Eur. J. Oper. Res., 2010)

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. - Artur Alves Pessoa; Eduardo Uchoa; Marcus Poggi de Aragão; Rosiane de Freitas Rodrigues (Math. Program. Comput., 2010)

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. - Anand Subramanian 001; Eduardo Uchoa; Artur Alves Pessoa; Luiz Satoru Ochi (Oper. Res. Lett., 2011)

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (SEA, 2013)

Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm - Alexandre Domingues Gonçalves; Lúcia Maria de A. Drummond; Artur Alves Pessoa; Peter M. Hahn (CoRR, 2013)

A branch-and-cut algorithm for the discrete (r∣p)-centroid problem. - Marcos Costa Roboredo; Artur Alves Pessoa (Eur. J. Oper. Res., 2013)

The time dependent traveling salesman problem: polyhedra and algorithm. - Hernán G. Abeledo; Ricardo Fukasawa; Artur Alves Pessoa; Eduardo Uchoa (Math. Program. Comput., 2013)

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. - Anand Subramanian 001; Eduardo Uchoa; Artur Alves Pessoa; Luiz Satoru Ochi (Optim. Lett., 2013)

Formulations for a problem of petroleum transportation. - Luiz Aizemberg; Hugo Harry Kramer; Artur Alves Pessoa; Eduardo Uchoa (Eur. J. Oper. Res., 2014)

Exact algorithms for the traveling salesman problem with draft limits. - Maria Battarra; Artur Alves Pessoa; Anand Subramanian 001; Eduardo Uchoa (Eur. J. Oper. Res., 2014)

Memory aware load balance strategy on a parallel branch-and-bound application. - Juliana M. N. Silva; Cristina Boeres; Lúcia M. A. Drummond; Artur Alves Pessoa (Concurr. Comput. Pract. Exp., 2015)

Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique. - Alexandre Domingues Gonçalves; Artur Alves Pessoa; Lúcia Maria de Assumpção Drummond; Cristiana Bentes; Ricardo C. Farias (CoRR, 2015)

Robust Network Design with Uncertain Outsourcing Cost. - Artur Alves Pessoa; Michael Poss (INFORMS J. Comput., 2015)

Robust constrained shortest path problems under budgeted uncertainty. - Artur Alves Pessoa; Luigi Di Puglia Pugliese; Francesca Guerriero; Michael Poss (Networks, 2015)

Multiobjective optimization of strategies for operation and testing of low-demand safety instrumented systems using a genetic algorithm and fault trees. - Antonio Eduardo Bier Longhi; Artur Alves Pessoa; Pauli Adriano de Almada Garcia (Reliab. Eng. Syst. Saf., 2015)

A new model and a reformulation for the crude distillation unit charging problem with oil blends and sequence-dependent changeover costs. - Luiz Cláudio Sayão Cortez; Artur Alves Pessoa (Comput. Chem. Eng., 2016)

A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem. - Walton Pereira Coutinho; Roberto Quirino do Nascimento; Artur Alves Pessoa; Anand Subramanian 001 (INFORMS J. Comput., 2016)

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem. - Frederico Galaxe Paes; Artur Alves Pessoa; Thibaut Vidal (Eur. J. Oper. Res., 2017)

New benchmark instances for the Capacitated Vehicle Routing Problem. - Eduardo Uchoa; Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Thibaut Vidal; Anand Subramanian 001 (Eur. J. Oper. Res., 2017)

A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique. - Alexandre Domingues Gonçalves; Artur Alves Pessoa; Cristiana Bentes; Ricardo C. Farias; Lúcia Maria de A. Drummond (INFORMS J. Comput., 2017)

Improved branch-cut-and-price for capacitated vehicle routing. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa (Math. Program. Comput., 2017)

Limited memory Rank-1 Cuts for Vehicle Routing Problems. - Diego Pecin; Artur Alves Pessoa; Marcus Poggi; Eduardo Uchoa; Haroldo G. Santos (Oper. Res. Lett., 2017)

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. - Yuri Laio T. V. Silva; Anand Subramanian 001; Artur Alves Pessoa (Comput. Oper. Res., 2018)

Integer programming formulations for three sequential discrete competitive location problems with foresight. - José Gentile; Artur Alves Pessoa; Michael Poss; Marcos Costa Roboredo (Eur. J. Oper. Res., 2018)

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Eur. J. Oper. Res., 2018)

A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification. - Hugo Quadros; Marcos Costa Roboredo; Artur Alves Pessoa (Expert Syst. Appl., 2018)

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (INFORMS J. Comput., 2018)

On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. - Teobaldo Bulhões; Artur Alves Pessoa; Fábio Protti; Eduardo Uchoa (Oper. Res. Lett., 2018)

An exact approach for the r-interdiction covering problem with fortification. - Marcos Costa Roboredo; Luiz Aizemberg; Artur Alves Pessoa (Central Eur. J. Oper. Res., 2019)

Robust scheduling with budgeted uncertainty. - Marin Bougeret; Artur Alves Pessoa; Michael Poss (Discret. Appl. Math., 2019)

Primal Heuristics for Branch and Price: The Assets of Diving Methods. - Ruslan Sadykov; François Vanderbeck; Artur Alves Pessoa; Issam Tahiri; Eduardo Uchoa (INFORMS J. Comput., 2019)

An exact approach for the r-interdiction median problem with fortification. - Marcos Costa Roboredo; Artur Alves Pessoa; Luiz Aizemberg (RAIRO Oper. Res., 2019)

Exact methods for the discrete multiple allocation (r|p) hub-centroid problem. - Antonio Camargo Andrade de Araújo; Marcos Costa Roboredo; Artur Alves Pessoa; Valdecy Pereira (Comput. Oper. Res., 2020)

An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems. - Daniel Oliveira 010; Artur Alves Pessoa (INFORMS J. Comput., 2020)

A generic exact solver for vehicle routing and related problems. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa; François Vanderbeck (Math. Program., 2020)

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints. - Guilherme Henrique Ismael de Azevedo; Artur Alves Pessoa; Anand Subramanian 001 (Eur. J. Oper. Res., 2021)

Iterated local search for single machine total weighted tardiness batch scheduling. - Eduardo Queiroga; Rian G. S. Pinheiro; Quentin Christ; Anand Subramanian 001; Artur Alves Pessoa (J. Heuristics, 2021)

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty. - Artur Alves Pessoa; Michael Poss; Ruslan Sadykov; François Vanderbeck (Oper. Res., 2021)

Solving Bin Packing Problems Using VRPSolver Models. - Artur Alves Pessoa; Ruslan Sadykov; Eduardo Uchoa (Oper. Res. Forum, 2021)

A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. - Ruslan Sadykov; Eduardo Uchoa; Artur Alves Pessoa (Transp. Sci., 2021)

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling. - Artur Alves Pessoa; Teobaldo Bulhões; Vitor Nesello; Anand Subramanian 001 (INFORMS J. Comput., 2022)

Single machine robust scheduling with budgeted uncertainty. - Marin Bougeret; Artur Alves Pessoa; Michael Poss (Oper. Res. Lett., 2023)

Approximating the chance-constrained capacitated vehicle routing problem with robust optimization. - Karina Thiebaut; Artur Alves Pessoa (4OR, 2023)

A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. - Isaac Balster; Teobaldo Bulhões; Pedro Munari; Artur Alves Pessoa; Ruslan Sadykov (Transp. Sci., 2023)

Computing the worst-case due dates violations with budget uncertainty. - Igor Malheiros; Artur Alves Pessoa; Michael Poss; Anand Subramanian 001 (Oper. Res. Lett., 2024)

Influence optimization in networks: New formulations and valid inequalities. - Vinicius Ferreira; Artur Alves Pessoa; Thibaut Vidal (Comput. Oper. Res., 2025)

An exact approach for the Vehicle Routing Problem with Demand Allocation. - Bruno Oliveira; Diogo Lima; Artur Alves Pessoa; Marcos Costa Roboredo (Comput. Oper. Res., 2025)

A hybrid GRASP and tabu-search heuristic and an exact method for a variant of the multi-compartment vehicle routing problem. - Carlos Leonardo Ramos Póvoa; Marcos Costa Roboredo; André Soares Velasco; Artur Alves Pessoa; Frederico Galaxe Paes (Expert Syst. Appl., 2025)

On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables. - Artur Alves Pessoa; Daniel De Araujo; Eduardo Uchoa (Oper. Res. Lett., 2025)

Hybrid iterated local search algorithm for the vehicle routing problem with lockers. - Bruno Oliveira; Artur Alves Pessoa; Marcos Costa Roboredo (J. Heuristics, 2025)