BibTeX
CSL-JSON
MLA
Harvard
Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design
release_yb57bgkwq5gerfew3j72dc5rru
by
R. Ravi, F. S. Salman
Archived Files and Locations
application/pdf 205.0 kB
file_yxfzuhcdyndfzhtry2k5xwak4a
|
web.archive.org (webarchive) www.contrib.andrew.cmu.edu (web) |
application/pdf 286.3 kB
file_f53cyf7penbprpq4f6ctt7wuge
|
web.archive.org (webarchive) repository.cmu.edu (web) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Year 1999
chapter
Stage
published
Year 1999
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar