Pedro Henrique Del Bianco Hokama

Learn More
This paper addresses the two-stage stochastic Steiner tree problem (SSTP), which is one of the Steiner problems that belongs to the 11th DIMACS challenge. In the SSTP there is a finite number of scenarios in which the terminal set and the edge costs are subject to uncertainty. In the first stage, we have the probabilistic information in terms of possible(More)
We consider a transport system problem which involves route planning for vehicles with containers attached, and cargo accommodation. The specific problem considered is the vehicle routing problem with loading constraints. Its input consists of a weighted undirected graph where vertices corresponds to clients and edges costs represents the cost to move the(More)
In this paper, we present a branch-and-cut algorithm for the Vehicle Routing Problem with Two-dimensional Loading Constraints (2L-CVRP). The 2L-CVRP is a combination of the Capacitated Vehicle Routing Problem (CVRP) and the Two-dimensional Bin Packing Problem. We propose a strategy based on emphasizing cut generation using known families of valid(More)
  • 1