Abstract: In this article, we initiate our exploration with a time-varying optimization problem, featuring linear equality constraints. To address this complex problem, we introduce a novel continuous ...

Abstract: The minimum dominant set problem in graphs is a well-known NP-hard problem that requires the use of heuristics to obtain approximate solutions due to its computational complexity. Among the ...