Edgar Alberto Cabral

TL;DR: A method to find low cost shift schedules with a time-varying service level that is always above a specified minimum, in an attempt to eliminate infeasibility without eliminating the optimal solution.

TL;DR: In this article, historical diurnal price pattern s in 14 deregulated markets were analyzed to give an initial prediction of the economic incentive for energy storage, and the authors ranked the 14 markets based on available revenue and potential return on investment: the incentive to store energy varies significantly between markets.

TL;DR: In this article, a lower bound procedure and four heuristics for the NPDR with relays are presented. But the lower bound is not applicable to the case of the first relay, the last relay, or any two consecutive relays.

TL;DR: The network design problem with relays (NDPR) is defined on an undirected graph G = (V, E, K), where V = 1, …, n is a vertex set and E = {(i, j) : i, j ∈ V, i

TL;DR: In this paper, a transformation of the hierarchical Chinese postman problem into an equivalent Rural Postman Problem (RPP) is presented, where the edges of a graph are partitioned into clusters and must be serviced while respecting a hierarchy, or precedence relation, between clusters.