Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GraphStream / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-011-9396-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975081448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bibliography on domination in graphs and some basic definitions of domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for determining dominating sets in graphs of maximum degree five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty in d. c. programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a dominating set on bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3353057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:04, 6 July 2024

scientific article
Language Label Description Also known as
English
Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
scientific article

    Statements

    Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (English)
    0 references
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    0 references
    DC programming and DCA
    0 references
    exact penalty
    0 references
    minimum dominating set
    0 references
    0 references