Distance constraints on cyclic networks : a new polynomially solvable class
Item Usage Stats
MetadataShow full item record
Distance Constraints Problem is to locate new facilities on a network so that the distances between new and existing facilities as well as between pairs of now facilities do not exceed given upper bounds, 'rhc ])roblem is N F-Complele on cyclic networks. The oidy known polynornially solvable class of distance constraints on cyclic networks is the case when the linkage network, which is an auxiliary graph induced by the distance bounds between new facility pairs, is a tree. In this thesis, we identify a new polynornially solvable class where each new facilit}'^ is restricted to an a priori specified feasible region which is confined to a single edge and where the linkage network is cj^clic with the restriction that there exists a node whose deletion breaks all cycles. We then extend the above class to a more general class where the linkage network has a cut vertex whose blocks fulfill the above assumptions
T57.85 .E45 1997
Industrial location--Mathematical models.
Network analysis (Planning).