Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights
%0 Journal Article
%1 ReveliotisNazeem13
%A Reveliotis, Spyros
%A Nazeem, Ahmed
%D 2013
%J SIAM Journal on Control and Optimization
%K citas, citeulike deadlock, referencias
%N 2
%P 1707--1726
%R 10.1137/120866427
%T Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights
%U http://dx.doi.org/10.1137/120866427
%V 51
@article{ReveliotisNazeem13,
added-at = {2017-09-08T10:52:59.000+0200},
author = {Reveliotis, Spyros and Nazeem, Ahmed},
biburl = {https://www.bibsonomy.org/bibtex/204f4dda746f5aaa853dc3ebe4c66fcf0/fernand0},
citeulike-article-id = {12364250},
citeulike-linkout-0 = {http://dx.doi.org/10.1137/120866427},
day = 23,
doi = {10.1137/120866427},
interhash = {ba64471615cc24fd2b846173a97620e2},
intrahash = {04f4dda746f5aaa853dc3ebe4c66fcf0},
issn = {0363-0129},
journal = {SIAM Journal on Control and Optimization},
keywords = {citas, citeulike deadlock, referencias},
month = apr,
number = 2,
pages = {1707--1726},
posted-at = {2013-05-24 16:57:17},
priority = {2},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights}},
url = {http://dx.doi.org/10.1137/120866427},
volume = 51,
year = 2013
}