File:TSP degree constraints.png
Size of this preview: 800 × 514 pixels. Other resolutions: 320 × 206 pixels | 640 × 411 pixels | 857 × 551 pixels.
Original file (857 × 551 pixels, file size: 6 KB, MIME type: image/png)
Captions
Captions
Add a one-line explanation of what this file represents
Summary
edit
| Description | This figure illustrates the degree constraints of the Symmetric Traveling Salesman Problem: each node must have exactly one incoming and one outgoing link of the tour. |
| Date | |
| Source | self-made using xfig |
| Author | User:Sdo |
|
This diagram 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 degree constraints.svg”—then the template Vector version available (or Vva) does not need the new image name parameter. |
Licensing
edit
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 2.5 Generic license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 11:03, 21 September 2010 | | 857 × 551 (6 KB) | Trockennasenaffe (talk | contribs) | optimized with OptiPNG |
| 17:27, 19 August 2006 |  | 857 × 551 (12 KB) | Sdo (talk | contribs) | Changed from asymmetric to symmetric TSP (undirected graph instead of directed one). | |
| 21:28, 18 April 2006 |  | 1,440 × 956 (26 KB) | Sdo (talk | contribs) | {{Information| |Description=This figure illustrates the degree constraints of the Asymmetric Traveling Salesman Problem: each node must have exactly one incoming and one outgoing link of the tour. |Source=self-made using xfig |Date=April 18, 2006 |Author= | |
| 21:27, 18 April 2006 |  | 1,440 × 956 (26 KB) | Sdo (talk | contribs) | {{Information| |Description=This figure illustrates the degree constraints of the Asymmetric Traveling Salesman Problem: each node must have exactly one incoming and one outgoing link of the tour. |Source=self-made using xfig |Date=April 18, 2006 |Author= |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on ca.wikipedia.org
- Usage on de.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
