On combinatorial optimization for dominating sets (literature survey, new models)
arXiv:2009.09288v13 citations
AI Analysis
This is an incremental contribution for researchers in combinatorial optimization, focusing on modeling improvements without new empirical validation.
The paper surveys connected dominating set problems and proposes new integer programming formulations with multiset estimates, but does not report specific numerical results or performance gains.
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set problems are illustrated by simplifyed numerical examples. New integer programming formulations of dominating set problems (with multiset estimates) are suggested.