Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
INOC
/
Paper
Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem.
Alexandre Salles da Cunha
Venue
C
INOC
Year
2019
Proceedings
INOC
DBLP record
conf/inoc/Cunha19 ↗
Browse the full
INOC paper archive
.