Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

Abstract: This paper addresses the problems of diagnosability verification and enforcement of discrete event systems modeled with unbounded Petri nets. Diagnosability in such systems is critical for ...