Umeå University's logo

umu.sePublications
EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An exact polynomial-time algorithm for the optimal solution of traveling salesman problems
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2021 (English)Manuscript (preprint) (Other academic)
Place, publisher, year, edition, pages
2021. Vol. 12, no 4, p. 17-32
Keywords [en]
Discrete optimization, traveling salesman problem, linear Diophantine equations, integer programming, sub-tours elimination
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:umu:diva-233433OAI: oai:DiVA.org:umu-233433DiVA, id: diva2:1924343
Available from: 2025-01-04 Created: 2025-01-04 Last updated: 2025-01-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Pya Arnqvist, Natalya

Search in DiVA

By author/editor
Pya Arnqvist, Natalya
By organisation
Department of Mathematics and Mathematical Statistics
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 107 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.47.0
|
WCAG
|
Log in
|
Manuals
|
Contact the Library