Artur Alves Pessoa

According to our database1, Artur Alves Pessoa authored at least 62 papers between 1998 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing.
Transp. Sci., 2021

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints.
Eur. J. Oper. Res., 2021

2020
A generic exact solver for vehicle routing and related problems.
Math. Program., 2020

An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems.
INFORMS J. Comput., 2020

Exact methods for the discrete multiple allocation (<i>r</i>|<i>p</i>) hub-centroid problem.
Comput. Oper. Res., 2020

2019
An exact approach for the r-interdiction median problem with fortification.
RAIRO Oper. Res., 2019

Primal Heuristics for Branch and Price: The Assets of Diving Methods.
INFORMS J. Comput., 2019

Robust scheduling with budgeted uncertainty.
Discret. Appl. Math., 2019

An exact approach for the r-interdiction covering problem with fortification.
Central Eur. J. Oper. Res., 2019

2018
On the complete set packing and set partitioning polytopes: Properties and rank 1 facets.
Oper. Res. Lett., 2018

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation.
INFORMS J. Comput., 2018

A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification.
Expert Syst. Appl., 2018

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems.
Eur. J. Oper. Res., 2018

Integer programming formulations for three sequential discrete competitive location problems with foresight.
Eur. J. Oper. Res., 2018

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times.
Comput. Oper. Res., 2018

2017
Limited memory Rank-1 Cuts for Vehicle Routing Problems.
Oper. Res. Lett., 2017

Improved branch-cut-and-price for capacitated vehicle routing.
Math. Program. Comput., 2017

A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique.
INFORMS J. Comput., 2017

New benchmark instances for the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2017

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem.
Eur. J. Oper. Res., 2017

2016
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem.
INFORMS J. Comput., 2016

A new model and a reformulation for the crude distillation unit charging problem with oil blends and sequence-dependent changeover costs.
Comput. Chem. Eng., 2016

2015
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., 2015

Robust constrained shortest path problems under budgeted uncertainty.
Networks, 2015

Robust Network Design with Uncertain Outsourcing Cost.
INFORMS J. Comput., 2015

Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique.
CoRR, 2015

Memory aware load balance strategy on a parallel branch-and-bound application.
Concurr. Comput. Pract. Exp., 2015

2014
Exact algorithms for the traveling salesman problem with draft limits.
Eur. J. Oper. Res., 2014

Formulations for a problem of petroleum transportation.
Eur. J. Oper. Res., 2014

2013
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.
Optim. Lett., 2013

The time dependent traveling salesman problem: polyhedra and algorithm.
Math. Program. Comput., 2013

A branch-and-cut algorithm for the discrete (r∣p)-centroid problem.
Eur. J. Oper. Res., 2013

Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm
CoRR, 2013

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2011
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery.
Oper. Res. Lett., 2011

2010
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems.
Math. Program. Comput., 2010

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique.
Eur. J. Oper. Res., 2010

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem.
Networks, 2009

2008
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008

A note on the construction of error detecting/correcting prefix codes.
Inf. Process. Lett., 2008

2007
Reducing human interactions in Web directory searches.
ACM Trans. Inf. Syst., 2007

2004
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites.
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003
Dois problemas de OtimizaçãO EM Grafos: Transporte EM Redes de Dutos E Busca com Custos de Acessos.
PhD thesis, 2003

The complexity of makespan minimization for pipeline transportation.
Theor. Comput. Sci., 2003

2002
A strategy for searching with different access costs.
Theor. Comput. Sci., 2002

On Binary Searching with Nonuniform Costs.
SIAM J. Comput., 2002

Pipeline Transportation of Petroleum Products with No Due Dates.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Three space-economical algorithms for calculating minimum-redundancy prefix codes.
IEEE Trans. Inf. Theory, 2001

On binary searching with non-uniform costs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999
Bounding the Compression Loss of the FGK Algorithm.
J. Algorithms, 1999

A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Practical Constructions of L-restricted Alphabetic Prefix Codes.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

Strategies for Searching with Different Access Costs.
Proceedings of the Algorithms, 1999

Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes.
Proceedings of the Data Compression Conference, 1999

A Work Efficient Parallel Algorithm for Constructing Huffman Codes.
Proceedings of the Data Compression Conference, 1999

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes.
Proceedings of the Algorithm Engineering and Experimentation, 1999

1998
In-Place Length-Restricted Prefix Coding.
Proceedings of the String Processing and Information Retrieval: A South American Symposium, 1998


  Loading...