A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/inoc/OncanAA19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/inoc/OncanAA19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/I._Kuban_Altinel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/M._Hakan_Aky%E2%88%9A%C4%BEz
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Temel_%E2%88%9A%C4%96ncan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.5441%2F002%2Finoc.2019.07
>
foaf:
homepage
<
https://doi.org/10.5441/002/inoc.2019.07
>
dc:
identifier
DBLP conf/inoc/OncanAA19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.5441%2F002%2Finoc.2019.07
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
rdfs:
label
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/I._Kuban_Altinel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/M._Hakan_Aky%E2%88%9A%C4%BEz
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Temel_%E2%88%9A%C4%96ncan
>
swrc:
pages
31-36
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/inoc/2019
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/inoc/OncanAA19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/inoc/OncanAA19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/inoc/inoc2019.html#OncanAA19
>
rdfs:
seeAlso
<
https://doi.org/10.5441/002/inoc.2019.07
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/inoc
>
dc:
title
A Branch-and-Bound Algorithm for the Maximum Weight Perfect Matching Problem with Conflicting Edge Pairs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document