Optimal Linear Separation of the Safe and Unsafe Subspaces of Sequential Resource Allocation Systems as a Set-Covering Problem: Algorithmic Procedures and Geometric Insights
DOI10.1137/120866427zbMath1286.68023MaRDI QIDQ2840155
Ahmed Nazeem, Spyros A. Reveliotis
Publication date: 17 July 2013
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cdf1ad61ad52e21cccbf9a74a238132d1186767b
deadlock avoidance; discrete event systems; classification theory; polyhedral theory; set-covering problem
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C27: Combinatorial optimization
93C65: Discrete event control/observation systems
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
68W27: Online algorithms; streaming algorithms
Related Items
