Now showing items 1-3 of 3
The robust spanning tree problem with interval data
Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...
Joint mixability of some integer matrices
(Elsevier B.V.Elsevier BV, 2016)
We study the problem of permuting each column of a given matrix to achieve minimum maximal row sum or maximum minimal row sum, a problem of interest in probability theory and quantitative finance where quantiles of a random ...
Restricted robust uniform matroid maximization under interval uncertainty
For the problem of selecting p items with interval objective function coefficients so as to maximize total profit, we introduce the r-restricted robust deviation criterion and seek solutions that minimize the r-restricted ...