File:TSP Deutschland 3.png

TSP_Deutschland_3.png ‎(326 × 350 pixels, file size: 15 KB, MIME type: image/png)

Summary

This map of europe image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.


It is recommended to name the SVG file “TSP Deutschland 3.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.
Description

Kürzester Rundreiseweg durch die 15 größten Städte Deutschlands (14 sind genannt, Dortmund fehlt).

Insgesamt sind 14!/2 = 43.589.145.600 verschiedene Wege möglich.
Date 21 October 2005 (original upload date)
Source https://www.cia.gov/cia/publications/factbook/maps/gm-map.gif
Author The original uploader was Kapitän Nemo at German Wikipedia.
Permission
(Reusing this file)		 https://www.cia.gov/cia/publications/factbook/docs/contributor_copyright.html

Licensing

Public domain
This image is in the public domain because it contains materials that originally came from the United States Central Intelligence Agency's World Factbook.

Bahasa Indonesia ∙ čeština ∙ Deutsch ∙ eesti ∙ English ∙ español ∙ Esperanto ∙ français ∙ galego ∙ hrvatski ∙ italiano ∙ Nederlands ∙ norsk nynorsk ∙ polski ∙ português ∙ sicilianu ∙ slovenščina ∙ suomi ∙ Türkçe ∙ Zazaki ∙ беларуская (тарашкевіца) ∙ македонски ∙ русский ∙ српски / srpski ∙ українська ∙ ქართული ∙ বাংলা ∙ தமிழ் ∙ മലയാളം ∙ 한국어 ∙ 日本語 ∙ 中文 ∙ 中文（简体） ∙ 中文（繁體） ∙ العربية ∙ +/−


Original upload log

Transferred from de.wikipedia to Commons using CommonsHelper.

The original description page was here. All following user names refer to de.wikipedia.
  • 2007-01-10 12:45 MrMonstar 328×352× (15511 bytes) {{Information |Beschreibung=Kürzester Rundreiseweg durch die 15 größten Städte Deutschlands. Insgesamt sind [[Fakultät_(Mathematik)|14!]]/2 = 43 589 145 600 verschiedene Wege möglich. |Quelle=Auf Basis der modifizierten [https://www.cia.gov/cia/publ
  • 2005-10-21 10:44 Kapitän Nemo 328×352× (21053 bytes) == Beschreibung, Quelle und Lizenz == Optimaler Reiseweg eines Handlungsreisenden durch die 15 größten Städte Deutschlands. Auf Basis der modifizierten [http://www.cia.gov/cia/publications/factbook/maps/gm-map.gif CIA-Karte] selbst gezeichnet. == Liz

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

inception

21 October 2005

MIME type

image/png

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current14:36, 1 January 2021326 × 350 (15 KB)Ras67frame removed
03:50, 28 December 2008328 × 352 (15 KB)Amirki{{Information |Description={{de|Kürzester Rundreiseweg durch die 15 größten Städte Deutschlands. Insgesamt sind 14!/2 = 43 589 145 600 verschiedene Wege möglich.}} |Source={{PD-user-w|de|wikipedia|MrMonstar}} |Date= |Author={{PD-user-w|de|wikipedia|M

Global file usage

The following other wikis use this file:

  • Usage on ar.wikipedia.org
    • علم الحاسوب
  • Usage on bg.wikipedia.org
    • Информатика
  • Usage on bs.wikipedia.org
    • Računarska nauka
  • Usage on ca.wikipedia.org
    • Problema del viatjant de comerç
    • Ciències de la computació
    • Viatjant
  • Usage on cs.wikipedia.org
    • Teorie složitosti
    • Teoretická informatika
  • Usage on de.wikipedia.org
    • Graphentheorie
    • Problem des Handlungsreisenden
    • Geoinformationssystem
    • Portal:Informatik/Exzellente Artikel
    • Portal:Mathematik/Exzellente Artikel
    • Benutzerin:Anitagraser/Baustelle/WikiProjekt Geoinformatik/Geoinformationssystem
  • Usage on de.wikiversity.org
    • Epidemiologische Distanz
  • Usage on de.wiktionary.org
    • Rundreise
  • Usage on el.wikipedia.org
    • Θεωρητική Πληροφορική
  • Usage on es.wikipedia.org
    • Ciencias de la computación
  • Usage on fr.wikipedia.org
    • Recherche opérationnelle
    • Problème du voyageur de commerce
    • Algorithme d'approximation
    • Théorie de la complexité (informatique théorique)
    • Algorithme de Christofides
  • Usage on gl.wikipedia.org
    • Complexidade computacional
  • Usage on he.wikipedia.org
    • פורטל:מתמטיקה/תמונה נבחרת/גלריה
    • פורטל:מתמטיקה/תמונה נבחרת/36
    • פורטל:מדעי המחשב/תמונה נבחרת/גלריה
    • פורטל:מדעי המחשב/תמונה נבחרת/60
  • Usage on hu.wikipedia.org
    • Az utazó ügynök problémája
  • Usage on id.wikipedia.org
    • Ilmu komputer teoretis
  • Usage on it.wikipedia.org
    • Informatica
  • Usage on lt.wikipedia.org
    • Keliaujančio pirklio uždavinys
  • Usage on mwl.wikipedia.org
    • Cumplexidade cumputacional
  • Usage on nl.wikipedia.org
    • Handelsreizigersprobleem
  • Usage on nl.wiktionary.org
    • handelsreizigersprobleem
  • Usage on pl.wikipedia.org
    • Informatyka
  • Usage on pl.wiktionary.org
    • Rundreise
  • Usage on pt.wikipedia.org
    • Complexidade computacional
    • Ciência da computação teórica
  • Usage on ro.wikipedia.org
    • Teoria complexității
  • Usage on ru.wikipedia.org
    • Информатика
    • Задача коммивояжёра
    • Комбинаторная оптимизация
    • Участник:Tatyanakaushinis/Черновик
  • Usage on simple.wikipedia.org
    • Travelling salesman problem
  • Usage on sk.wikipedia.org
    • Portál:Matematika/Odporúčané články
    • Portál:Matematika/Odporúčaný článok/10
    • Portál:Matematika/Odporúčané články/Univerzálne
  • Usage on sl.wikipedia.org
    • Problem trgovskega potnika
  • Usage on sq.wikipedia.org
    • Shkenca kompjuterike

View more global usage of this file.

Retrieved from "https://en.wikipedia.org/wiki/File:TSP_Deutschland_3.png"