We study the approximation of general multiobjective optimization proble...
It is well known that, under very weak assumptions, multiobjective
optim...
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...
In a widely studied class of multi-parametric optimization problems, the...
This article investigates the approximation quality achievable for
biobj...
This article focuses on a biobjective extension of the maximum flow netw...
Parity check matrices (PCMs) are used to define linear error correcting ...
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 ...
Papadimitriou and Yannakakis show that the polynomial-time solvability o...
We determine the power of the weighted sum scalarization with respect to...
This article generalizes the Near-Shortest Paths Problem introduced by B...
The Alternating Direction Method of Multipliers has recently been adapte...
We investigate the single-source-single-destination "shortest" paths pro...