Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA - Université de Lorraine Access content directly
Journal Articles Journal of Combinatorial Optimization Year : 2012

Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

Dates and versions

hal-01636733 , version 1 (16-11-2017)

Identifiers

Cite

Julien Schleich, Hoai An Le Thi, Pascal Bouvry. Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA. Journal of Combinatorial Optimization, 2012, 24 (4), pp.397 - 412. ⟨10.1007/s10878-011-9396-0⟩. ⟨hal-01636733⟩

Collections

UNIV-LORRAINE
29 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More