Unformatted text preview: • Any basic feasible solution of the LP corresponds
to a Spanning Tree of the network graph.
• A graph with m nodes forms a Spanning Tree, if:
– ignore the arrows on the arcs
include (m arcs, in this case 3 arcs
connect all the nodes
Such that there are no loops 5 ...
View Full Document
This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto.
- Spring '11