Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights (Q2840155): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:21, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights |
scientific article |
Statements
Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights (English)
0 references
17 July 2013
0 references
discrete event systems
0 references
deadlock avoidance
0 references
classification theory
0 references
set-covering problem
0 references
polyhedral theory
0 references
