A branch-and-cut algorithm for the target visitation problem. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/ejco/Hildenbrandt19>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Achim_Hildenbrandt>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2Fs13675-019-00111-x>
foaf:homepage	<https://doi.org/10.1007/s13675-019-00111-x>
dc:identifier	DBLP journals/ejco/Hildenbrandt19 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2Fs13675-019-00111-x (xsd:string)
dcterms:issued	2019 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/ejco>
rdfs:label	A branch-and-cut algorithm for the target visitation problem. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Achim_Hildenbrandt>
swrc:number	3 (xsd:string)
swrc:pages	209-242 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/ejco/Hildenbrandt19/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/ejco/Hildenbrandt19>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/ejco/ejco7.html#Hildenbrandt19>
rdfs:seeAlso	<https://doi.org/10.1007/s13675-019-00111-x>
dc:title	A branch-and-cut algorithm for the target visitation problem. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	7 (xsd:string)