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 the recoverable robust spanning tree problem with interval edge costs is considered. The complexity of this problem has remained open to date. By using an iterative relaxation method, it is shown that the problem is polynomially solvable. A generalization of this idea to the recoverable robust matroid basis problem is also presented. Polynomial algorithms for both recoverable robust...
This paper deals with the max–min and min–max regret versions of the maximum weighted independent set problem on interval graphs with uncertain vertex weights. Both problems have been recently investigated by Talla Nobibon and Leus (Optim Lett 8:227–235, 2014), who showed that they are NP-hard for two scenarios and strongly NP-hard if the number of scenarios is a part of the input. In this paper,...
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.