In this work we consider the network equilibrium problem formulated as convex minimization problem whose variables are the path flows. In order to take into account the difficulties related to the large dimension of real network problems we adopt a decomposition-based approach suitably combined...

We propose a parallel algorithm for computing exact solutions to the problem of minimizing the number of multileaf collimator apertures needed in step-and-shoot intensity modulated radiotherapy. These problems are very challenging particularly as the problem size increases. Here, we investigate...

This paper addresses a network pricing problem where users are assigned to the paths of a transportation network according to a mixed logit model, i.e., price sensitivity varies across the user population. For its solution, we propose algorithms based on combinatorial approximations, and show...

The single-row facility layout problem <Emphasis FontCategory="NonProportional">(SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. <Emphasis FontCategory="NonProportional">(SRFLP) is the one-dimensional version...</emphasis></emphasis>