default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtur Alves Pessoa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j53]Vinicius Ferreira
, Artur Alves Pessoa, Thibaut Vidal:
Influence optimization in networks: New formulations and valid inequalities. Comput. Oper. Res. 173: 106857 (2025)- [j52]Carlos Leonardo Ramos Póvoa, Marcos Costa Roboredo, André Soares Velasco, Artur Alves Pessoa, Frederico Galaxe Paes:
A hybrid GRASP and tabu-search heuristic and an exact method for a variant of the multi-compartment vehicle routing problem. Expert Syst. Appl. 259: 125319 (2025) - 2024
- [j51]Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian:
Computing the worst-case due dates violations with budget uncertainty. Oper. Res. Lett. 56: 107148 (2024) - 2023
- [j50]Karina Thiebaut, Artur Alves Pessoa:
Approximating the chance-constrained capacitated vehicle routing problem with robust optimization. 4OR 21(3): 513-531 (2023) - [j49]Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Single machine robust scheduling with budgeted uncertainty. Oper. Res. Lett. 51(2): 137-141 (2023) - [j48]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): 1359-1378 (2023) - 2022
- [j47]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): 1512-1530 (2022) - 2021
- [j46]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): 809-824 (2021) - [j45]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): 353-438 (2021) - [j44]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): 739-754 (2021) - [j43]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa:
Solving Bin Packing Problems Using VRPSolver Models. Oper. Res. Forum 2(2) (2021) - [j42]Ruslan Sadykov, Eduardo Uchoa, Artur Alves Pessoa:
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing. Transp. Sci. 55(1): 4-28 (2021) - 2020
- [j41]Antonio Camargo Andrade de Araújo, Marcos Costa Roboredo, Artur Alves Pessoa, Valdecy Pereira:
Exact methods for the discrete multiple allocation (r|p) hub-centroid problem. Comput. Oper. Res. 116: 104870 (2020) - [j40]Daniel Oliveira, Artur Alves Pessoa:
An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems. INFORMS J. Comput. 32(1): 90-100 (2020) - [j39]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A generic exact solver for vehicle routing and related problems. Math. Program. 183(1): 483-523 (2020)
2010 – 2019
- 2019
- [j38]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): 111-131 (2019) - [j37]Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261: 93-107 (2019) - [j36]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): 251-267 (2019) - [j35]Marcos Costa Roboredo, Artur Alves Pessoa, Luiz Aizemberg:
An exact approach for the r-interdiction median problem with fortification. RAIRO Oper. Res. 53(2): 505-516 (2019) - [c20]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
A Generic Exact Solver for Vehicle Routing and Related Problems. IPCO 2019: 354-369 - 2018
- [j34]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: 142-160 (2018) - [j33]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): 872-881 (2018) - [j32]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): 530-543 (2018) - [j31]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: 311-322 (2018) - [j30]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): 339-360 (2018) - [j29]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): 389-392 (2018) - 2017
- [j28]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): 742-756 (2017) - [j27]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): 845-858 (2017) - [j26]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): 676-687 (2017) - [j25]Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa:
Improved branch-cut-and-price for capacitated vehicle routing. Math. Program. Comput. 9(1): 61-100 (2017) - [j24]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): 206-209 (2017) - 2016
- [j23]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: 49-62 (2016) - [j22]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): 752-765 (2016) - 2015
- [j21]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): 1122-1144 (2015) - [j20]Artur Alves Pessoa, Michael Poss:
Robust Network Design with Uncertain Outsourcing Cost. INFORMS J. Comput. 27(3): 507-524 (2015) - [j19]Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss:
Robust constrained shortest path problems under budgeted uncertainty. Networks 66(2): 98-111 (2015) - [j18]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: 525-538 (2015) - [i3]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 abs/1510.02065 (2015) - 2014
- [j17]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): 115-128 (2014) - [j16]Luiz Aizemberg, Hugo Harry Kramer, Artur Alves Pessoa, Eduardo Uchoa:
Formulations for a problem of petroleum transportation. Eur. J. Oper. Res. 237(1): 82-90 (2014) - [c19]Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Eduardo Uchoa:
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing. IPCO 2014: 393-403 - 2013
- [j15]Marcos Costa Roboredo, Artur Alves Pessoa:
A branch-and-cut algorithm for the discrete (r∣p)-centroid problem. Eur. J. Oper. Res. 224(1): 101-109 (2013) - [j14]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): 27-55 (2013) - [j13]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): 1569-1581 (2013) - [c18]Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck:
In-Out Separation and Column Generation Stabilization by Dual Price Smoothing. SEA 2013: 354-365 - [i2]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 abs/1302.5679 (2013) - [i1]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 abs/1304.0267 (2013) - 2011
- [j12]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): 338-341 (2011) - 2010
- [j11]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): 54-63 (2010) - [j10]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): 259-290 (2010) - [c17]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: 202-213
2000 – 2009
- 2009
- [j9]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): 167-177 (2009) - 2008
- [j8]Artur Alves Pessoa:
A note on the construction of error detecting/correcting prefix codes. Inf. Process. Lett. 107(1): 34-38 (2008) - [j7]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): 443-472 (2008) - 2007
- [j6]Ornan Ori Gerstel, Shay Kutten, Eduardo Sany Laber, Rachel Matichin, David Peleg, Artur Alves Pessoa, Críston P. de Souza:
Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25(4): 20 (2007) - [c16]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: 150-160 - 2004
- [c15]Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza:
Efficient Implementation of Hotlink Assignment Algorithm for Web Sites. ALENEX/ANALC 2004: 79-87 - [c14]Artur Alves Pessoa:
Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks. ISAAC 2004: 766-777 - [c13]Artur Alves Pessoa, Eduardo Sany Laber, Críston P. de Souza:
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC 2004: 778-792 - 2003
- [b1]Artur Alves Pessoa:
Dois problemas de OtimizaçãO EM Grafos: Transporte EM Redes de Dutos E Busca com Custos de Acessos. Pontifical Catholic University of Rio de Janeiro, Brazil, 2003 - [j5]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
The complexity of makespan minimization for pipeline transportation. Theor. Comput. Sci. 306(1-3): 339-351 (2003) - 2002
- [j4]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
On Binary Searching with Nonuniform Costs. SIAM J. Comput. 31(4): 1022-1047 (2002) - [j3]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
A strategy for searching with different access costs. Theor. Comput. Sci. 287(2): 571-584 (2002) - [c12]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products. APPROX 2002: 243-255 - [c11]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Pipeline Transportation of Petroleum Products with No Due Dates. LATIN 2002: 248-262 - 2001
- [j2]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): 2185-2198 (2001) - [c10]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
On binary searching with non-uniform costs. SODA 2001: 855-864 - 2000
- [c9]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: 229-235
1990 – 1999
- 1999
- [j1]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
Bounding the Compression Loss of the FGK Algorithm. J. Algorithms 32(2): 195-211 (1999) - [c8]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: 1-17 - [c7]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes. Data Compression Conference 1999: 267-276 - [c6]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
A Work Efficient Parallel Algorithm for Constructing Huffman Codes. Data Compression Conference 1999: 277-286 - [c5]Ruy Luiz Milidiú, Eduardo Sany Laber, Artur Alves Pessoa:
Bounding the Compression Loss of the FGK Algorithm. Data Compression Conference 1999: 539 - [c4]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
Strategies for Searching with Different Access Costs. ESA 1999: 236-247 - [c3]Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
Practical Constructions of L-restricted Alphabetic Prefix Codes. SPIRE/CRIWG 1999: 115-119 - [c2]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes. SPIRE/CRIWG 1999: 128-134 - 1998
- [c1]Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber:
In-Place Length-Restricted Prefix Coding. SPIRE 1998: 50-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
