6.18.11 Network Flow

# 6.18.11 Network Flow - Nodes and Arcs(Vertices Network Flow...

This preview shows pages 1–2. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Nodes and Arcs (Vertices) Network Flow Problems = Class of Linear Programming problems dealing with networks and movements Node = specific point or location in network; usu drawn as dot or circle; aka vertex Arc = a connection, unidirection, between two nodes (or the length between two nodes); aka edge Network = a collection of locations (nodes) and the connections between pairs of these locations (arcs); network aka 'graph" Edge can be directed or unidirectional (drawn as an arrow); Edges can also have un/capacitated or have non/capacity capacitated= limited/labeled with capacity (ex of capacity arc is a length of cable cord - it only has a certain bandwith) uncapicatated = not limited *There are 3 kinds of nodes: Origins, aka sources or supply points, are where resources enter the network Destination, aka demand point or sink, are where resources leave the network or are consumed, etc....
View Full Document

{[ snackBarMessage ]}

### Page1 / 4

6.18.11 Network Flow - Nodes and Arcs(Vertices Network Flow...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online