Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a r...
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...