The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we consider the minimax regret centdian location problem in general dynamic networks with positive edge lengths and interval vertex weights, where the centdian point should be located on a vertex only. Let G=(V,E) be an undirected connected simple graph with n vertices. Each vertex has a weight that is not known precisely, but the interval to which it belongs is given. A particular...
In this study, we consider the minimax regret 1-sink location problem with accessibility, where all of the weights should always evacuate to the nearest sink point along the shortest path in a dynamic general network with positive edge lengths and uniform edge capacity. Let G=(V,E) be an undirected connected simple graph with n vertices and m edges. Each vertex has a weight that is not known exactly...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.