Compressive sensing is a new field in signal processing and applied mathematics. It allows one to simultaneously sample and compress signals which are known to have a sparse representation in a known basis or dictionary ...

Introduction: This work proposes a model and two heuristic algorithms to assign customers to trucks and visit days as a first phase in the solution of a real-world routing problem, which is closely related to the PVRP ...

We study a generalized version of the linear ordering problem: Given a collection of partial orders represented by directed trees with unique root and height one, where each tree is associated with a nonnegative reward, ...

The paper deals with the product design problem where the characteristics of new and remanufactured products must be determined. The objective of the problem is to maximize the total profit taking into account the design ...

Mixed integer linear programming is one of the main approaches used to solve unit commitment problems. Due to the computational complexity of unit commitment problems, several researches remark the benefits of using less ...

In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) of linear programming problems posed in infinite dimensional Banach spaces, and their corresponding dual problems, under ...

We study the capacitated m-ring-star problem (CmRSP) that faces the design of minimum cost network structure that connects customers with m rings using a set of ring connections that share a distinguished node (depot), and ...