CSci 688 (Kincaid/Fall 2013)
Quiz (Chapters 1 and 3)
September 6, 2013
Name:
1. (5 pts) In planar location models the Manhattan (l1 ) and Euclidean (l2 ) distance
metrics are often used. Do these metrics work on a graph (network)? Why or why
not?
In gener
Key for Exam 1 Spring 2011
1. x(0) = (1000), f (x(0) ) = 9, and M = cfw_(1000), (0100), (0010), (0001). In iteration 1
the four moves lead to (2000), (1100), (1010) and (1001). The rst solution, (2000),
is infeasible since x1 = 2 violates the zero/one res
CSci 658 (Kincaid/Spring 2013)
Key for Homework Problems 12-3bd, 12-4b, 12-11abc, 12-15 and 12-17ab
January 28, 2013
12-3(b) No, this is not a relaxation. Replacing x1 0 with x1 0 and integer is a tightening
of the feasible region. Previously x = (1.5, 0,
Csci 658 (Kincaid/Spring 2013)
Key for Homework Assignment 2 (Ch 12: 21, 26, 28, 31 and 41)
February 4, 2013
34 points possible (12, 6, 6, 5, 5)
12-21(a) There are 16 possible ways to assign 0 and 1 to the 4 components of any solution. The
rst 2 constrain