Multi-constructor CMSA for the maximum disjoint dominating sets problem
From MaRDI portal
Publication:6065657
DOI10.1016/j.cor.2023.106450MaRDI QIDQ6065657
Roberto Maria Rosati, Christian Blum, Salim Bouamama
Publication date: 15 November 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
reinforcement learningwireless sensor networkinstance reductiondomatic partition problemCMSAmaximum disjoint dominating sets problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preference-inspired co-evolutionary algorithms using weight vectors
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Analyzing bandit-based adaptive operator selection mechanisms
- On approximating the minimum independent dominating set
- An improved exact algorithm for the domatic number problem
- Finding happiness: an analysis of the maximum happy vertices problem
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem
- A comparative analysis of two matheuristics by means of merged local optima networks
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- A cutting plane algorithm for graph coloring
- A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems
- Metaheuristics for the minimum gap graph partitioning problem
- Emergence of Scaling in Random Networks
- Domatic Partition on Several Classes of Graphs
- Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
- Towards a theory of domination in graphs
- Approximating theDomatic Number
- An improved hybrid self-inertia weight adaptive particle swarm optimization algorithm with local search
- Collective dynamics of ‘small-world’ networks
- Mathematical Foundations of Computer Science 2005
- An upper bound for the chromatic number of a graph and its application to timetabling problems
This page was built for publication: Multi-constructor CMSA for the maximum disjoint dominating sets problem