aus Wikipedia, der freien Enzyklopädie
[edit] Summary
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.
|
Source |
own work, created using xfig and fig2dev.
|
Date |
August 27, 2006
|
Author |
Sdo
|
Permission |
see below
|
[edit] Licensing
I, the author of this work, hereby publish it under the following license:
|
Dateiverweise
Die folgenden Artikel benutzen diese Datei: