File:TSP cutting plane.png

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Original file(983 × 733 pixels, file size: 8 KB, MIME type: image/png)

Summary[edit]

Description

Illustrates the intersection of the unit cube with the cutting plane . In the context of the Traveling salesman problem on three nodes, this (rather weak) inequality states that every tour must have at least two edges.

Date
Source own work, created using xfig and fig2dev.
Author Sdo


Converted to SVG.svg
This diagram image could be recreated 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 cutting plane.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:
w:en:Creative Commons

attribution share alike

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 alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one.

File history

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

Date/TimeThumbnailDimensionsUserComment
current11:08, 21 September 2010Thumbnail for version as of 11:08, 21 September 2010983 × 733 (8 KB)Trockennasenaffe (talk | contribs)optimized with OptiPNG
18:09, 27 August 2006Thumbnail for version as of 18:09, 27 August 2006983 × 733 (17 KB)Sdo (talk | contribs){{Information |Description=Illustrates the intersection of the unit cube with the cutting plane <math>x_1 + x_2 + x_3 \geq 2</math>. In the context of the Traveling salesman problem on three nodes, this (rather weak) inequality states that every tour must
  • You cannot overwrite this file.

There are no pages that use this file.

File usage on other wikis

The following other wikis use this file: