# File:TSP cutting plane.png

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

## Summary

 Description Illustrates the intersection of the unit cube with the cutting plane ${\displaystyle x_{1}+x_{2}+x_{3}\geq 2}$. 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 27 August 2006 Source own work, created using xfig and fig2dev. Author Sdo

 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

I, the copyright holder of this work, hereby publish it under the following license:

## File history

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

Date/TimeThumbnailDimensionsUserComment
current11:08, 21 September 2010983 × 733 (8 KB)Trockennasenaffe (talk | contribs)optimized with OptiPNG
18:09, 27 August 2006983 × 733 (17 KB)Sdo (talk | contribs){{Information |Description=Illustrates the intersection of the unit cube with the cutting plane [itex]x_1 + x_2 + x_3 \geq 2[/itex]. 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:

• Usage on de.wikipedia.org
• Usage on en.wikipedia.org
• Usage on ru.wikipedia.org
• Usage on uk.wikipedia.org
• Usage on zh.wikipedia.org