MIE376 Lec 10 - NP Slides(1).page14

MIE376 Lec 10 NP - Others shortest path max flow Algorithms remain in textbooks More commonly solved with network simplex Labels remain and may be

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
14 Assignment, Transportation, Transhipment … Prior to network simplex algorithm OR used special algorithms for special structures Assignment Transportation Transhipment
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Others: shortest path, max flow Algorithms remain in textbooks More commonly solved with network simplex Labels remain and may be useful for formulations...
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- Toronto.

Ask a homework question - tutors are online