Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
type: Item
instance of: scholarly article
title: Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem
author: Stefan Kapunac
published in: Serdica Journal of Computing
publication date: 2024-11-14T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 7944746
zbMATH Keywords: integer linear programming
zbMATH Keywords: greedy heuristic
zbMATH Keywords: domination problems
MaRDI profile type: Publication
cites work: Domination in Graphs: Core Concepts
cites work: An order-based algorithm for minimum dominating set with application in graph mining
cites work: The weighted independent domination problem: integer linear programming models and metaheuristic approaches
cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
cites work: Exact and heuristic algorithms for the weighted total domination problem
cites work: Q3267900
cites work: Unit disk graphs
cites work: The use of ranks to avoid the assumption of normality implicit in the analysis of variance.
DOI: 10.55630/SJC.2023.17.117-136
description: scientific article; zbMATH DE number 7944746