Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Artur Alves Pessoa
2010 – today
- 2013
[j14]Marcos Costa Roboredo, Artur Alves Pessoa: A branch-and-cut algorithm for the discrete (r∣p)-centroid problem. European Journal of Operational Research 224(1): 101-109 (2013)- [j13]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)
- [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 Maria de 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. European Journal of Operational Research 206(1): 54-63 (2010)
- [j10]Artur Alves Pessoa, Eduardo Uchoa, Marcus Poggi de Aragão, Rosiane 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 de Souza: Reducing human interactions in Web directory searches. ACM Trans. Inf. Syst. 25(4) (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 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 de Souza: Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. ISAAC 2004: 778-792
- 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 Transactions on Information 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:13 CEST by the dblp team