Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem

DOI10.55630/SJC.2023.17.117-136MaRDI QIDQ6638677

Stefan Kapunac

Publication date: 14 November 2024

Published in: Serdica Journal of Computing (Search for Journal in Brave)

zbMATH Keywords

integer linear programminggreedy heuristicdomination problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• An order-based algorithm for minimum dominating set with application in graph mining
• Unit disk graphs
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Exact and heuristic algorithms for the weighted total domination problem
• The use of ranks to avoid the assumption of normality implicit in the analysis of variance.
• Domination in Graphs: Core Concepts

This page was built for publication: Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638677)