"Formulation and Branch-and-cut algorithm for the Minimum Cardinality ..."

Alexandre Salles da Cunha (2019)

> Home

Details and statistics

DOI: 10.5441/002/INOC.2019.06

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/inoc/Cunha19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/inoc/Cunha19
Alexandre Salles da Cunha:
Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. INOC 2019: 25-30

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.