R basics
M. Veeraraghavan
Aug. 24, 2014
Data vector: an array of single elements. Can ask for length of a data vector, not dim. A data vector can consist of numeric, character or logical values (http:/www.statmethods.net/input/
datatypes.html).
Matrix - r
SYS 3021 - Homework Assignment 2 Solutions
Due 14 September 2016
Problem 1
Solution: (Part a.)Notice that the problem statement asks for each node to encode (encapsulate) all the
inspection decisions for each of the possible paths. A method of accomplishi
SYS 3021
Deterministic Decision Models
Lecture 5:
Dijkstras Method
1
Admin
HW #1 due today
HW # 2 posted, due next week
2
Motivation
Last time we modeled various word problems as a
shortest path problems
The Seervada Park problem was easy and obvious.
SYS 3021 - Homework Assignment 3 Solutions
Due 21 September 2016
Problem 1
Solution:
The knapsack problem must be revised to include weight and volume constraints. In order to keep track
of volume we will add another superscript to each node. The first su
SYS 3021
Lecture 6
The Bellman-Ford Method
1
Admin
HW #2
Due Wednesday
HW#3 posted Wednesday
Due the following Wednesday
Midterm #1
September 28th (2 weeks and 2 days from now)
Office Hours
2
Last Time
Dijkstras method.
Our first algorithm for sh
SYS 3021
Deterministic Decision Models
Lecture 4:
Shortest Path Problems
Announcements
Homework Assignment 1 due Wednesday.
Homework Assignment 2 will be posted
Wednesday.
Motivation
Shortest path problems
show up often, and often in unexpected ways
SYS 3021 Network Modeling
Lecture 3
Language of Network Optimization
Motivation:
Network Optimization
The special structure for the semester lies in
the fact that our optimization models will
generally be described in terms of a network or
graph.
Thus, we
SYS 3021 - Homework Assignment 3
Due 21 September 2016
Instructions: Solve each of the following exercises. Give quantitative answers where required, and always
explain your reasoning. Finally, pledge your solutions.
Problem 1
Multi-dimensional Knapsack P
SYS 3021 - Homework Assignment 2
Due 14 September 2016
Instructions: Solve each of the following exercises. Give quantitative answers where required, and always
explain your reasoning. Finally, pledge your solutions.
Problem 1
Consider the shortest path m
Lecture 7
Performance of Algorithms
P.A. Beling and S.D. Patek
Department of Systems and Information Engineering
University of Virginia
SYS 3021
P.A. Beling and S.D. Patek (UVA)
Lecture 7
SYS 3021
1 / 33
Roadmap
Last Time.
- Bellman-Ford method.
- Algorit