Minimum Spanning Tree Problem

From LinkedAUB Collab
Revision as of 12:22, 2 January 2014 by Sfg02 (talk | contribs) (Created page with "{{Learning concept |Description=This type of problem cannot be solved as an LP problem but is solved easily using a simple manual algorithm. |Wikipedia reference=http://en.wik...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Description

This type of problem cannot be solved as an LP problem but is solved easily using a simple manual algorithm.

Concept Prerequisite

Wikipedia Reference

http://en.wikipedia.org/wiki/Minimum spanning tree problem

Learning Material

Covered in Topic(s)

 
Network Flow Models