S.I. : New Challenges in Combinatorial Optimization
ISSN:
1382-6905 (Print)
1573-2886 (Online)
In this topical collection (7 articles)
-
OriginalPaper
Approximation algorithm for the minimum partial connected Roman dominating set problem
Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du Article:62 -
OriginalPaper
The average size of maximal matchings in graphs
Alain Hertz, Sébastien Bonte, Gauvain Devillez… Article:46 -
OriginalPaper
A branch-and-cut algorithm for the balanced traveling salesman problem
Thi Quynh Trang Vo, Mourad Baiou, Viet Hung Nguyen Article:4
Continue reading...
To view the rest of this content please follow the download PDF link above.