In p-median location interdiction the aim is to find a subset of edges i...
The minimum cost flow problem is one of the most studied network optimiz...
This article focuses on a biobjective extension of the maximum flow netw...
In this article, we study a biobjective extension of the shortest path
n...
A variant of the classical knapsack problem is considered in which each ...
This article generalizes the Near-Shortest Paths Problem introduced by B...
We investigate the single-source-single-destination "shortest" paths pro...