A branch-and-cut algorithm for the connected max-k-cut problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/eor/HealyJLMMR24
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/eor/HealyJLMMR24
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Franc_Marchetti
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nicolas_Jozefowiez
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Patrick_Healy
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pierre_Laroche
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%A9bastien_Martin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Zsuzsanna_R%E2%88%9A%E2%89%A5ka
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.ejor.2023.06.015
>
foaf:
homepage
<
https://doi.org/10.1016/j.ejor.2023.06.015
>
dc:
identifier
DBLP journals/eor/HealyJLMMR24
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.ejor.2023.06.015
(xsd:string)
dcterms:
issued
2024
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/eor
>
rdfs:
label
A branch-and-cut algorithm for the connected max-k-cut problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Franc_Marchetti
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nicolas_Jozefowiez
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Patrick_Healy
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pierre_Laroche
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/S%E2%88%9A%C2%A9bastien_Martin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Zsuzsanna_R%E2%88%9A%E2%89%A5ka
>
swrc:
month
January
(xsd:string)
swrc:
number
1
(xsd:string)
swrc:
pages
117-124
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/eor/HealyJLMMR24/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/eor/HealyJLMMR24
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/eor/eor312.html#HealyJLMMR24
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.ejor.2023.06.015
>
dc:
title
A branch-and-cut algorithm for the connected max-k-cut problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
312
(xsd:string)