Advisors
Now showing items 1-2 of 2
-
Distance constraints on cyclic networks : a new polynomially solvable class
(Bilkent University, 1997)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 ... -
Unidirectional loop newtork layout problem in flexible manufactaring systems
(Bilkent University, 1999)Unidirectional Loop Networks are the most common architecture in FMSs. This is partly due to lower implementation costs of unidirectional loop networks. But mainly it is the higher flexibility unidirectional loop ...
