This paper introduces a decomposition of the Elementary Shortest Path Problem with Resource Constraints(ESPPRC), where the path is combined by smaller sub paths. We show computationals result by comparing different approaches for the decomposition and compare the best of these with existing algorithms. We show that the algorithm for many instances outperforms a bidirectional labeling algorithm.

Earth observation satellites are platforms equipped with optical instruments that orbit the Earth in order to take photographs of specific areas at the request of users. This article is concerned with the management of several satellites performing multiple orbits over a given planning horizon. It describes a tabu search heuristic for the problem of selecting and scheduling the requests to be s...

This paper presents a method for optimizing oil production on large scale production networks such as the Troll west field in the North Sea. The method is based on piecewise linearization of all nonlinearities, and on decomposition of the full scale problem into smaller sub-problems. Column generation in a Branch & Price framework is used to solve the decomposed problem. The methods differs fro...

Data networks are subject to congestion, thereby the delay to go across the network may be large enough in order to dishearten customers to keep on using such a network. In this paper we address the problem of determining in a given network a routing which minimizes the delay or keeps it under a certain bound. This problem was already shown as NP complete. Our main contribution is to study it i...

In this paper we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of the matheuristics: decomposition approaches, im...

Wireless sensor networks involve many different real-world contexts, such as monitoring and control tasks for traffic, surveillance, military and environmental applications, among others. Usually, these applications consider the use of a large number of low-cost sensing devices to monitor the activities occurring in a certain set of target locations. We want to individuate a set of covers (that...

Network coding-based link failure recovery techniques provide near-hitless recovery and offer high capacity efficiency. Diversity coding is the first technique to incorporate coding in this field and is easy to implement over small arbitrary networks. However, its capacity efficiency is restricted by its systematic coding and high design complexity even though its design complexity is lower tha...

Given an undirected graph, a bramble is a set of connected subgraphs (called bramble elements) such that every pair of subgraphs either contains a common node, or such that an edge (i, j) exists with node i belonging to one subgraph and node j belonging to the other. In this paper, we examine the problem of finding the bramble number of a graph, along with a set of bramble elements that yields ...

An important problem in the context of wireless sensor networks is the Maximum Network Lifetime Problem (MLP): find a collection of subset of sensors (cover) each covering the whole set of targets and assign them an activation time so that network lifetime is maximized. In this paper we consider a variant of MLP, where we allow each cover to neglect a certain fraction (1−α) of the targets. We a...