Artur Alves Pessoa

Pauli Adriano de Almada Garcia

Reliab. Eng. Syst. Saf., 2015

Robust constrained shortest path problems under budgeted uncertainty.

[BibT_eX]

[DOI]

Luigi Di Puglia Pugliese

Francesca Guerriero

Michael Poss

Networks, 2015

Robust Network Design with Uncertain Outsourcing Cost.

[BibT_eX]

[DOI]

Alexandre Domingues Gonçalves

Michael Poss

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.

[BibT_eX]

[DOI]

Lúcia Maria de Assumpção Drummond

Cristiana Bentes

Ricardo C. Farias

CoRR, 2015

Memory aware load balance strategy on a parallel branch-and-bound application.

[BibT_eX]

[DOI]

Concurr. Comput. Pract. Exp., 2015

2014

Exact algorithms for the traveling salesman problem with draft limits.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Formulations for a problem of petroleum transportation.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

2013

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.

[BibT_eX]

[DOI]

Optim. Lett., 2013

The time dependent traveling salesman problem: polyhedra and algorithm.

[BibT_eX]

[DOI]

Math. Program. Comput., 2013

A branch-and-cut algorithm for the discrete (r∣p)-centroid problem.

[BibT_eX]

[DOI]

Marcos Costa Roboredo

Alexandre Domingues Gonçalves

Eur. J. Oper. Res., 2013

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

[BibT_eX]

[DOI]

Lúcia Maria de A. Drummond

Peter M. Hahn

CoRR, 2013

In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2011

2010

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems.

[BibT_eX]

[DOI]

Rosiane de Freitas Rodrigues

Eduardo Uchoa

Marcus Poggi de Aragão

Math. Program. Comput., 2010

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009

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

[BibT_eX]

[DOI]

Eduardo Uchoa

Marcus Poggi de Aragão

Networks, 2009

2008

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

[BibT_eX]

[DOI]

Marcus Poggi de Aragão

Diogo Andrade

Math. Program., 2008

A note on the construction of error detecting/correcting prefix codes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

2007

Reducing human interactions in Web directory searches.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2007

2004

Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search.

[BibT_eX]

[DOI]

Críston P. de Souza

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Efficient Implementation of Hotlink Assignment Algorithm for Web Sites.

[BibT_eX]

Críston P. de Souza

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.

[BibT_eX]

[DOI]

PhD thesis, 2003

The complexity of makespan minimization for pipeline transportation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

A strategy for searching with different access costs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

On Binary Searching with Nonuniform Costs.

[BibT_eX]

[DOI]

SIAM J. Comput., 2002

Pipeline Transportation of Petroleum Products with No Due Dates.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001

Three space-economical algorithms for calculating minimum-redundancy prefix codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On binary searching with non-uniform costs.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Fast Calculation of Optimal Strategies for Searching with Non-Uniform Costs.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

1999

Bounding the Compression Loss of the FGK Algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 1999

A Fast and Space-Economical Algorithm for Calculating Minimum Redundancy Prefix Codes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

Two Space-Economical Algorithms for Calculating Minimum Redundancy Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

A Work Efficient Parallel Algorithm for Constructing Huffman Codes.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1999

Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, 1999

1998

In-Place Length-Restricted Prefix Coding.

[BibT_eX]

[DOI]