Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...