"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the ..."

Bernard Gendron et al. (2014)

> Home

Details and statistics

DOI: 10.1287/IJOC.2013.0589

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informs/GendronLCS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informs/GendronLCS14
Bernard Gendron, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem. INFORMS J. Comput. 26(4): 645-657 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.