#### Nearest neighbor

This

excel
sheet is to be used in the

nearest neighbor
assignment. Here are the

slides from the lecture.

#### Slides for the lectures

Here are the slides for the

VRP problem (4.1) and the

Facility Location problem (4.2). Here is the statement of
the

waste problem.

#### Solutions to section 4.1 problems

Here are solutions to

4.1 and
4.2.

#### VRP

Start with this

code and this

data.

#### Review materials for the test on **Thursday, 10/1**

For review on index sets, consult

this document,

this document, and

this document.
Here is a

practice test and
its

solution.

#### Code

Here is code for the examples on

set cover,

or-constraints,
and

TSP.

#### Updated Guinness

Here is an updated Guinness assignment sheet complete
with the correct optimal objective values. Please check your code's results
against these values.

#### Solutions to chapter 3 problems

Here are solutions to

3.2,3.3,3.5,3.8 and

3.16,
3.20, 3.24, 3.27, 3.29, and 3.32.

#### Code/notes for Thursday, 9/10

We use the following

mod and

dat file in class. Here are the

lecture notes.

#### Code for Thursday, 9/3

We use the following

mod and

dat file in class. We also
use the following

excel file.

#### Computers 9/3

Please bring your laptops to class on Thursday, 9/3.
#### Solutions to chapter 8 problems

Here are solutions to

8.3 and

8.10.

#### Week two lecture notes

In week one, we discuss

transportation models and the

min. cost network flow problem. The
code displayed in class is

here and

here.

#### Week one lecture notes

In week one, we

reviewed simplex and
modeled

this
problem. The code displayed in class was

the LP
model and it's

IP analog.

Here
is the hard IP I showed, which was given to me by

Jean Bernard Lasserre.

#### EI/Office hour change

The office hours for the course are Wednesday at 3rd and 4th periods.

#### Welcome!!

This is the course page for
SA405.