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 journals/siamco/ReveliotisN13
%A Reveliotis, Spyros A.
%A Nazeem, Ahmed
%D 2013
%J SIAM J. Control and Optimization
%K
%N 2
%P 1707-1726
%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://dblp.uni-trier.de/db/journals/siamco/siamco51.html#ReveliotisN13
%V 51
@article{journals/siamco/ReveliotisN13,
added-at = {2023-12-13T07:33:06.000+0100},
author = {Reveliotis, Spyros A. and Nazeem, Ahmed},
biburl = {https://www.bibsonomy.org/bibtex/2a39f8a296faabb20d328bcea9cab82f4/admin},
ee = {http://dx.doi.org/10.1137/120866427},
interhash = {ba64471615cc24fd2b846173a97620e2},
intrahash = {a39f8a296faabb20d328bcea9cab82f4},
journal = {SIAM J. Control and Optimization},
keywords = {},
number = 2,
pages = {1707-1726},
timestamp = {2023-12-13T07:33:06.000+0100},
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://dblp.uni-trier.de/db/journals/siamco/siamco51.html#ReveliotisN13},
volume = 51,
year = 2013
}
