The Minimum Cost Network Flow (MCNF) Problem

• Extremely useful model in IEOR

• Important Special Cases of the MCNF Problem

  • Transportation and Assignment Problems
  • Maximum Flow Problem
  • Minimum Cut Problem
  • Shortest Path Problem

• Network Structure

  • BFS for MCNF LPs always have integer values !!!
  • Problems can be formulated graphically

Next slide

Back to first slide

View graphic version