Search Results - "Pessoa, Artur"

A generic exact solver for vehicle routing and related problems by Pessoa, Artur, Sadykov, Ruslan, Uchoa, Eduardo, Vanderbeck, François

“…Major advances were recently obtained in the exact solution of vehicle routing problems (VRPs). Sophisticated branch-cut-and-price (BCP) algorithms for some of…”
Get full text

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems by Pessoa, Artur, Sadykov, Ruslan, Uchoa, Eduardo

“…•We propose a new Branch-Cut-and-Price algorithm for heterogeneous vehicle routing.•The same algorithm can also solve multi-depot and site-dependent vehicle…”
Get full text

Single machine robust scheduling with budgeted uncertainty by Bougeret, Marin, Pessoa, Artur, Poss, Michael

“…We consider robust single machine scheduling problems. First, we prove that with uncertain processing times, minimizing the number of tardy jobs is NP-hard…”
Get full text

A branch-and-cut algorithm for the multiple allocation r-hub interdiction median problem with fortification by Quadros, Hugo, Costa Roboredo, Marcos, Alves Pessoa, Artur

“…•New ILP formulation with a polynomial number of variables.•The branch-and-cut algorithm was proved to be robust, solving all instances.•Computational results…”
Get full text

Integer programming formulations for three sequential discrete competitive location problems with foresight by Gentile, José, Alves Pessoa, Artur, Poss, Michael, Costa Roboredo, Marcos

“…•Exact algorithms are proposed for three competitive location problems.•Several numerical experiments are presented assessing the algorithms efficiency.•The…”
Get full text

A branch-and-cut algorithm for the discrete (r∣p)-centroid problem by Roboredo, Marcos Costa, Pessoa, Artur Alves

“…► We present a branch-and-cut algorithm for the discrete (p∣r)-centroid problem. ► Our formulation has a polynomial number of variables. ► We define…”
Get full text

Iterated local search for single machine total weighted tardiness batch scheduling by Queiroga, Eduardo, Pinheiro, Rian G. S., Christ, Quentin, Subramanian, Anand, Pessoa, Artur A.

“…This paper presents an iterated local search (ILS) algorithm for the single machine total weighted tardiness batch scheduling problem. To our knowledge, this…”
Get full text

Exact algorithms for the traveling salesman problem with draft limits by Battarra, Maria, Pessoa, Artur Alves, Subramanian, Anand, Uchoa, Eduardo

“…•Three formulations and related exact algorithms for the TSP with draft limits are proposed.•The three index formulation dominates theoretically and…”
Get full text

Formulations for a problem of petroleum transportation by Aizemberg, Luiz, Kramer, Hugo Harry, Pessoa, Artur Alves, Uchoa, Eduardo

“…•We study tactical models for a crude oil transportation problem by tankers.•We did our work on the top of a previous paper found in the literature.•We use 50…”
Get full text

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery by Subramanian, Anand, Uchoa, Eduardo, Pessoa, Artur Alves, Ochi, Luiz Satoru

“…We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are…”
Get full text

Robust constrained shortest path problems under budgeted uncertainty by Alves Pessoa, Artur, Di Puglia Pugliese, Luigi, Guerriero, Francesca, Poss, Michael

“…We study the robust constrained shortest path problem under resource uncertainty. After proving that the problem is NP‐hard in the strong sense for arbitrary…”
Get full text

Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique by Pessoa, Artur Alves, Hahn, Peter M., Guignard, Monique, Zhu, Yi-Rong

“…In this paper, we propose two exact algorithms for the GQAP (generalized quadratic assignment problem). In this problem, given M facilities and N locations,…”
Get full text

Memory aware load balance strategy on a parallel branch-and-bound application by Silva, Juliana M.N., Boeres, Cristina, Drummond, Lúcia M.A., Pessoa, Artur A.

“…The latest trends in high performance computing systems show an increasing demand on the use of a large scale multicore system in an efficient way so that high…”
Get full text

An exact approach for the r-interdiction covering problem with fortification by Roboredo, Marcos Costa, Aizemberg, Luiz, Pessoa, Artur Alves

“…In this paper we treat the r -interdiction covering problem with fortification (RICF). The environment of this problem is composed of a set of customers J and…”
Get full text

Approximating the chance-constrained capacitated vehicle routing problem with robust optimization by Thiebaut, Karina, Pessoa, Artur

“…The Capacitated Vehicle Routing Problem (CVRP) is a classical combinatorial optimization problem that aims to serve a set of customers, using a set of…”
Get full text

Influence optimization in networks: New formulations and valid inequalities by Ferreira, Vinicius, Pessoa, Artur, Vidal, Thibaut

“…Influence propagation has been the subject of extensive study due to its important role in social networks, epidemiology, and many other areas. Understanding…”
Get full text

New benchmark instances for the Capacitated Vehicle Routing Problem by Uchoa, Eduardo, Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Vidal, Thibaut, Subramanian, Anand

“…•We show the limitations of existing Capacitated Vehicle Routing Problem instances.•We propose 100 new instances and evaluate recent exact and heuristic…”
Get full text

On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables by Pessoa, Artur, de Araujo, Daniel, Uchoa, Eduardo

Get full text

A hybrid genetic algorithm with decomposition phases for the Unequal Area Facility Layout Problem by Paes, Frederico Galaxe, Pessoa, Artur Alves, Vidal, Thibaut

“…•We consider the unequal area facility location problem with soft or hard dimensions.•We introduce two efficient hybrid genetic algorithms.•We use a…”
Get full text

Improved branch-cut-and-price for capacitated vehicle routing by Pecin, Diego, Pessoa, Artur, Poggi, Marcus, Uchoa, Eduardo

“…The best performing exact algorithms for the capacitated vehicle routing problem developed in the last 10 years are based in the combination of cut and column…”
Get full text