Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
type: Item
instance of: scholarly article
title: Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
zbMATH Open document ID: 1261.90082
author: Julien Schleich
author: Le Thi Hoai An
author: Pascal Bouvry
published in: Journal of Combinatorial Optimization
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6121549
zbMATH Keywords: DC programming and DCA
zbMATH Keywords: exact penalty
zbMATH Keywords: minimum dominating set
describes a project that uses: GraphStream
MaRDI profile type: Publication
full work available at URL: s10878-011-9396-0
OpenAlex ID: W1975081448
cites work: Rainbow domination in graphs
cites work: A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
cites work: Q3267900
cites work: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
cites work: Approximation algorithms for connected dominating sets
cites work: Q4552196
cites work: Bibliography on domination in graphs and some basic definitions of domination parameters
cites work: A randomized algorithm for determining dominating sets in graphs of maximum degree five
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
cites work: Exact penalty in d. c. programming
cites work: \(k\)-tuple domination in graphs
cites work: Finding a dominating set on bipartite graphs
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
cites work: Q3353057
cites work: Q4910758
cites work: Q4414647
DOI: 10.1007/S10878-011-9396-0
description: scientific article; zbMATH DE number 6121549