The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena. The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. In Julia Pahl, Torsten Reiners, Stefan Voß, editors, Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings. Volume 6701 of Lecture Notes in Computer Science, pages 162-169, Springer, 2011. [doi]

This author has not been identified. Look up 'Luidi Simonetti' in GoogleThis author has not been identified. Look up 'Alexandre Salles da Cunha' in GoogleThis author has not been identified. Look up 'Abilio Lucena' in Google

runs on WebDSL