Now showing items 1-2 of 2
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 ...
Composite regions of feasibility for certain classes of distance constrained network location problems
Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The ...