[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/inoc/Cunha19>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Alexandre_Salles_da_Cunha>
foaf:homepage <http://dx.doi.org/doi.org%2F10.5441%2F002%2Finoc.2019.06>
foaf:homepage <https://doi.org/10.5441/002/inoc.2019.06>
dc:identifier DBLP conf/inoc/Cunha19 (xsd:string)
dc:identifier DOI doi.org%2F10.5441%2F002%2Finoc.2019.06 (xsd:string)
dcterms:issued 2019 (xsd:gYear)
rdfs:label Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Alexandre_Salles_da_Cunha>
swrc:pages 25-30 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/inoc/2019>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/inoc/Cunha19/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/inoc/Cunha19>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/inoc/inoc2019.html#Cunha19>
rdfs:seeAlso <https://doi.org/10.5441/002/inoc.2019.06>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/inoc>
dc:title Formulation and Branch-and-cut algorithm for the Minimum Cardinality Balanced and Connected Clustering Problem. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document