|
Color Coding of LP's edge values
<../img/trans.gif height=12px>
 |
|
|
|
|
|
|
|
|
|
|
| |
| 0.01 |
0.15 |
0.25 |
0.35 |
0.45 |
0.55 |
0.65 |
0.75 |
0.85 |
0.95 |
1.00 |
(Greatest Values for Each Color)
If you can not see the above applet you should download an uptodate java plugin from
here .
|
This 41-city instance is based on the classic 49-city problem solved by Dantzig, Fulkerson, and Johnson in 1954.
The subset of permitted edges was created by taking the Delaunay triangulation of 41 of the cities and removing several long edges along the border of the point set.
The points were modified slightly from the original example in order to more easily visualize the connections between the cities.
| 
