We study a wide range of online covering and packing optimization problems. In an online covering problem, a linear cost function is known in advance, but the linear constraints that define the ...
This paper studies the close relation between the Gass-Saaty parametric programming algorithm and the 'primal-dual' procedures recently exploited by Dantzig, Ford, and Fulkerson. It is shown that the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback