[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/anor/AverbakhB02>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Igor_Averbakh>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Oded_Berman>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1023%2FA%3A1020759332183>
foaf:homepage <https://doi.org/10.1023/A:1020759332183>
dc:identifier DBLP journals/anor/AverbakhB02 (xsd:string)
dc:identifier DOI doi.org%2F10.1023%2FA%3A1020759332183 (xsd:string)
dcterms:issued 2002 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/anor>
rdfs:label Minmax p-Traveling Salesmen Location Problems on a Tree. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Igor_Averbakh>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Oded_Berman>
swrc:number 1-4 (xsd:string)
swrc:pages 55-68 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/anor/AverbakhB02/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/anor/AverbakhB02>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/anor/anor110.html#AverbakhB02>
rdfs:seeAlso <https://doi.org/10.1023/A:1020759332183>
dc:subject polynomial algorithm; location; traveling salesman problem (xsd:string)
dc:title Minmax p-Traveling Salesmen Location Problems on a Tree. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 110 (xsd:string)