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)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6188913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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; zbMATH DE number 6188913 |
Statements
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
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
0.7386280298233032
0 references
0.7335651516914368
0 references
0.7099502682685852
0 references
0.7059391736984253
0 references
