# Lecture25 - CSE 421 Algorithms Richard Anderson Lecture 25...

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

CSE 421 Algorithms Richard Anderson Lecture 25 Open Pit Mining

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

View Full Document
Today’s topics Open Pit Mining Problem Task Selection Problem Reduction to Min Cut problem S, T is a cut if S, T is a partition of the vertices with s in S and t in T The capacity of an S, T cut is the sum of the capacities of all edges going from S to T
Open Pit Mining Each unit of earth has a profit (possibly negative) Getting to the ore below the surface requires removing the dirt above Test drilling gives reasonable estimates of costs Plan an optimal mining operation

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

View Full Document
Mine Graph -3 -10 -4 3 -2 -3 -1 8 -2 4 3 -1 -7 -10 -1
Determine an optimal mine -10 -10 -10 -10 -10 -5 -1 -10 -10 -10 -10 -3 -3 4 6 -10 -10 -4 -3 7 8 1 -10 -4 3 -2 6 4 -10 2 4 -10 -3 4 -10 -4 4 3 -10 -10 -10 3 -3 -10 -10 -10 -10 -1 -10 -10 -10 -10 -10 -7

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

View Full Document
Precedence graph G=(V,E) Each v in V has a profit p(v) A set F if feasible if when w in F, and (v,w) in E, then v in F.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/25/2012 for the course CSE 421 taught by Professor Richardanderson during the Fall '06 term at University of Washington.

### Page1 / 16

Lecture25 - CSE 421 Algorithms Richard Anderson Lecture 25...

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

View Full Document
Ask a homework question - tutors are online