Sciweavers

DISOPT
2008
113views more  DISOPT 2008»
13 years 11 months ago
The inverse 1-median problem on a cycle
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...
DISOPT
2008
78views more  DISOPT 2008»
13 years 11 months ago
N-fold integer programming
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 ...
Jesús A. De Loera, Raymond Hemmecke, Shmuel...
DISOPT
2008
59views more  DISOPT 2008»
13 years 11 months ago
Nonconvex, lower semicontinuous piecewise linear optimization
Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhau...
DISOPT
2008
91views more  DISOPT 2008»
13 years 11 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
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...
Alper Atamtürk, Deepak Rajan
DISOPT
2008
53views more  DISOPT 2008»
13 years 11 months ago
Recent results on well-balanced orientations
Attila Bernáth, Satoru Iwata, Tamás ...
DISOPT
2008
66views more  DISOPT 2008»
13 years 11 months ago
Worst case examples of an exterior point algorithm for the assignment problem
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...
Charalampos Papamanthou, Konstantinos Paparrizos, ...