Matches in SemOpenAlex for { <https://semopenalex.org/work/W2021994503> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W2021994503 endingPage "2270" @default.
- W2021994503 startingPage "2267" @default.
- W2021994503 abstract "Abstract The traveling salesman problem is to find a minimum cost (weight) path for a given set of cities (vertices) and roads (edges). The path must start at a specified city and end there after going through all the other given cites only once. It is a classical NP-complete problem in graph theory. In this paper, we consider a DNA procedure for solving the traveling salesman problem in the Adleman–Lipton model. The procedure works in O ( n ) steps for the traveling salesman of an edge-weighted graph with n vertices." @default.
- W2021994503 created "2016-06-24" @default.
- W2021994503 creator A5005064985 @default.
- W2021994503 creator A5025100368 @default.
- W2021994503 creator A5048181508 @default.
- W2021994503 creator A5048817987 @default.
- W2021994503 date "2012-11-01" @default.
- W2021994503 modified "2023-09-26" @default.
- W2021994503 title "Solving traveling salesman problem in the Adleman–Lipton model" @default.
- W2021994503 cites W1977312644 @default.
- W2021994503 cites W1985073670 @default.
- W2021994503 cites W2003715806 @default.
- W2021994503 cites W2020827716 @default.
- W2021994503 cites W2027603534 @default.
- W2021994503 cites W2152955176 @default.
- W2021994503 doi "https://doi.org/10.1016/j.amc.2012.08.073" @default.
- W2021994503 hasPublicationYear "2012" @default.
- W2021994503 type Work @default.
- W2021994503 sameAs 2021994503 @default.
- W2021994503 citedByCount "19" @default.
- W2021994503 countsByYear W20219945032013 @default.
- W2021994503 countsByYear W20219945032014 @default.
- W2021994503 countsByYear W20219945032015 @default.
- W2021994503 countsByYear W20219945032016 @default.
- W2021994503 countsByYear W20219945032017 @default.
- W2021994503 countsByYear W20219945032020 @default.
- W2021994503 countsByYear W20219945032021 @default.
- W2021994503 countsByYear W20219945032022 @default.
- W2021994503 crossrefType "journal-article" @default.
- W2021994503 hasAuthorship W2021994503A5005064985 @default.
- W2021994503 hasAuthorship W2021994503A5025100368 @default.
- W2021994503 hasAuthorship W2021994503A5048181508 @default.
- W2021994503 hasAuthorship W2021994503A5048817987 @default.
- W2021994503 hasConcept C126255220 @default.
- W2021994503 hasConcept C175859090 @default.
- W2021994503 hasConcept C33923547 @default.
- W2021994503 hasConcept C41008148 @default.
- W2021994503 hasConcept C4331618 @default.
- W2021994503 hasConcept C7668213 @default.
- W2021994503 hasConceptScore W2021994503C126255220 @default.
- W2021994503 hasConceptScore W2021994503C175859090 @default.
- W2021994503 hasConceptScore W2021994503C33923547 @default.
- W2021994503 hasConceptScore W2021994503C41008148 @default.
- W2021994503 hasConceptScore W2021994503C4331618 @default.
- W2021994503 hasConceptScore W2021994503C7668213 @default.
- W2021994503 hasIssue "4" @default.
- W2021994503 hasLocation W20219945031 @default.
- W2021994503 hasOpenAccess W2021994503 @default.
- W2021994503 hasPrimaryLocation W20219945031 @default.
- W2021994503 hasRelatedWork W2005119019 @default.
- W2021994503 hasRelatedWork W2019808372 @default.
- W2021994503 hasRelatedWork W2133004095 @default.
- W2021994503 hasRelatedWork W2184672982 @default.
- W2021994503 hasRelatedWork W2253106201 @default.
- W2021994503 hasRelatedWork W2308371765 @default.
- W2021994503 hasRelatedWork W2356976268 @default.
- W2021994503 hasRelatedWork W2366076337 @default.
- W2021994503 hasRelatedWork W2495211334 @default.
- W2021994503 hasRelatedWork W810420948 @default.
- W2021994503 hasVolume "219" @default.
- W2021994503 isParatext "false" @default.
- W2021994503 isRetracted "false" @default.
- W2021994503 magId "2021994503" @default.
- W2021994503 workType "article" @default.