DISOPT
2008
13 years 4 months ago
2008
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...
DISOPT
2008
13 years 4 months ago
2008
DISOPT
2008
13 years 4 months ago
2008
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed n-fold integer programming problems are polynomial time ...
DISOPT
2008
13 years 4 months ago
2008
DISOPT
2008
13 years 4 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
DISOPT
2008
13 years 4 months ago
2008
DISOPT
2008
13 years 4 months ago
2008
An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for...