The 2-Edge-Connected Subgraph Polyhedron.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jco/VandenbusscheN05
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jco/VandenbusscheN05
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dieter_Vandenbussche
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/George_L._Nemhauser
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10878-005-1777-9
>
foaf:
homepage
<
https://doi.org/10.1007/s10878-005-1777-9
>
dc:
identifier
DBLP journals/jco/VandenbusscheN05
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10878-005-1777-9
(xsd:string)
dcterms:
issued
2005
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jco
>
rdfs:
label
The 2-Edge-Connected Subgraph Polyhedron.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dieter_Vandenbussche
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/George_L._Nemhauser
>
swrc:
number
4
(xsd:string)
swrc:
pages
357-379
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jco/VandenbusscheN05/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jco/VandenbusscheN05
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jco/jco9.html#VandenbusscheN05
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10878-005-1777-9
>
dc:
subject
network design; edge-connectivity; traveling salesman problem; polyhedra
(xsd:string)
dc:
title
The 2-Edge-Connected Subgraph Polyhedron.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
9
(xsd:string)