[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/ipco/GlaserP22>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Marc_E._Pfetsch>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Max_Gl%E2%88%9A%C2%A7ser>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-031-06901-7%5F22>
foaf:homepage <https://doi.org/10.1007/978-3-031-06901-7_22>
dc:identifier DBLP conf/ipco/GlaserP22 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-031-06901-7%5F22 (xsd:string)
dcterms:issued 2022 (xsd:gYear)
rdfs:label On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Marc_E._Pfetsch>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Max_Gl%E2%88%9A%C2%A7ser>
swrc:pages 291-304 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/ipco/2022>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/ipco/GlaserP22/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/ipco/GlaserP22>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/ipco/ipco2022.html#GlaserP22>
rdfs:seeAlso <https://doi.org/10.1007/978-3-031-06901-7_22>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/ipco>
dc:title On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document