IE170 Lab #1
Prof Jeff Linderoth
IE 170 Lab #1: Getting Started
Due Date: January 22, 2006. 1PM.
1
Description and Objectives
In this lab, we will set up our working environment for future labs, familiarize ourselves with Eclipse, and write som
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 29
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Matrix Review
This Time Solving Triangular Systems Solving Symmetric Positive Definite Sy
Sums
Arithmetic Series
IE170: Algorithms in Systems Engineering: Lecture 2
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
n
1 + 2 + + n =
k=1
k=
n(n + 1) 2
Sum Of Squares
n
k2 =
k=0
n(n + 1)(2n + 1) 6
Janu
All-Pairs Shortest Paths Floyd-Warshall Transitive Closure
All-Pairs Shortest Paths Floyd-Warshall Transitive Closure
Taking Stock IE170: Algorithms in Systems Engineering: Lecture 23
Jeff Linderoth
Department of Industrial and Systems Engineering
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 24
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Transitive Closure (Fast) Flows in Networks
March 28, 2007
This Time Flows, Flows, Flows
Algorithm Analysis Data Structures
Algorithm Analysis Data Structures
Background Correctness and Running Time
Taking Stock
Last Time In-Place, Out-of-Place Count Von Count Worst Case Analysis Jeff Linderoth
Department of Industrial and Systems Eng
Hashes Red-Black Trees
Hashes Red-Black Trees
Taking Stock
Last Time Hashes (Intro to) Binary Search Trees More on Java Collections Interfaces Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
IE170: Algorithms in S
Taking Stock
Last Time Lots of funky math
Playing with summations: Formulae and Bounds Sets
IE170: Algorithms in Systems Engineering: Lecture 3
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
A brief introduction t
BFS DFS
BFS DFS
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 17
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Depth-First Search
This Time: Uses of DFS Topological Sort Strongly Con
Measuring Functions Recurrences and Recursion
Measuring Functions Recurrences and Recursion
, O, Some Functions You'll See
Everyone Gets an A! Go Bears! IE170: Algorithms in Systems Engineering: Lecture 4
Jeff Linderoth
Department of Industrial a
Taking Stock
Last Time Lots of funky math
Playing with summations: Formulae and Bounds Sets
IE170: Algorithms in Systems Engineering: Lecture 3
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
A brief introduction t
DFS Review Topological Sort Strongly Connected Components
DFS Review Topological Sort Strongly Connected Components
Taking Stock IE170: Algorithms in Systems Engineering: Lecture 18
Jeff Linderoth
Department of Industrial and Systems Engineering Le
Measuring Functions Recurrences and Recursion
Measuring Functions Recurrences and Recursion
, O, Some Functions You'll See
Everyone Gets an A! Go Bears! IE170: Algorithms in Systems Engineering: Lecture 4
Jeff Linderoth
Department of Industrial a
Capital Budgeting Assembly Line Balancing
Capital Budgeting Assembly Line Balancing
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 12
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Intr
DFS Review Topological Sort Strongly Connected Components
DFS Review Topological Sort Strongly Connected Components
Taking Stock IE170: Algorithms in Systems Engineering: Lecture 18
Jeff Linderoth
Department of Industrial and Systems Engineering Le
This Time
IE170: Algorithms in Systems Engineering: Lecture 32
A whirlwind tour of computational complexity Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
You are not responsible for this material on the final, bu
Capital Budgeting Assembly Line Balancing
Capital Budgeting Assembly Line Balancing
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 12
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Intr
Bellman Ford Single Source Shortest Path on a DAG Dijkstra
Bellman Ford Single Source Shortest Path on a DAG Dijkstra
Taking Stock IE170: Algorithms in Systems Engineering: Lecture 22
Jeff Linderoth
Department of Industrial and Systems Engineering
Linear Algebra Review
Another Look at Matrix Multiplication
Important Notation
IE170: Algorithms in Systems Engineering: Lecture 28
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
If A Rmn , then Aj is the j th c
IE170 Lab #9
Mustafa R. Kilin & Prof. Linderoth c
IE 170 Lab #9: Traveling Salesperson
Due Date: April 21 , 2006. 11AM.
1
Description and Objectives
In the next couple of lab session, you will demonstrate your knowledge of graphs, trees, and pa
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 24
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Transitive Closure (Fast) Flows in Networks
March 28, 2007
This Time Flows, Flows, Flows
IE170 Lab #7
Mustafa R. Kilin & Jeff Linderoth c
IE 170 Lab #7: Graphs and Breadth-First Graph Search
Due Date: March 12, 2006. 11AM.
1
Description and Objectives
In this lab, you are going to implement a Graph class. This class will be a basis
Shortest Paths The Algorithms
Shortest Paths The Algorithms
Taking Stock IE170: Algorithms in Systems Engineering: Lecture 21
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Shortest Paths TSP in Lab
Ma
Algorithm Analysis Data Structures
Algorithm Analysis Data Structures
Background Correctness and Running Time
Taking Stock
Last Time In-Place, Out-of-Place Count Von Count Worst Case Analysis Jeff Linderoth
Department of Industrial and Systems Eng
Solving Linear Systems
IE170: Algorithms in Systems Engineering: Lecture 30
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last time we learned about how to solve systems Ax = b, when A was symmetric and positive-
IE170 Lab #8
Prof. Linderoth
IE 170 Lab #8: Spanning Trees
Due Date: March 19, 2006. 11AM.
1
Description and Objectives
In this lab, we will implement the well-known algorithm of Prim to find minimum spanning trees and compare its running time
Hashes Red-Black Trees
Hashes Red-Black Trees
Taking Stock
Last Time Hashes (Intro to) Binary Search Trees More on Java Collections Interfaces Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
IE170: Algorithms in S
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 25
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Flows
This Time (Cardinality) Matching Homework and Review
March 30, 2007
Jeff Linderot
Uncapacitated Lot Sizing Activity Selection
Uncapacitated Lot Sizing Activity Selection
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 14
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time
BFS DFS
BFS DFS
Taking Stock
IE170: Algorithms in Systems Engineering: Lecture 17
Jeff Linderoth
Department of Industrial and Systems Engineering Lehigh University
Last Time Depth-First Search
This Time: Uses of DFS Topological Sort Strongly Con