ps2 - Homework 2 IE418 – Discrete Optimization Dr. Ralphs...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Homework 2 IE418 – Discrete Optimization Dr. Ralphs Due February 13, 2007 1. Given a graph ( G = ( V, E ) with weights c v for all v ∈ V , formulate the following problems as mixed-integer programs. (a) Find a maximum-weight clique. (b) Find a minimum-weight dominating set (a set of nodes U ⊆ V such that every node of V is adjacent to some node of U ). 2. Recall the classical formulation of the Traveling Salesman Problem (TSP). Given a directed graph G = ( N, A ), feasible solutions consist of x ∈ Z A satisfying X j :( i,j ) ∈ A x ij = 1 for i ∈ N, (1) X i :( i,j ) ∈ A x ij = 1 for j ∈ N, and (2) X ( i,j ) ∈ A : i ∈ U,j ∈ N \ U x ij ≥ 1 for U ⊂ N with 2 ≤ | U | ≤ | N | - 2 , (3) 1 ≥ x ≥ (4) where the binary variables x ij for each ( i, j ) ∈ A represent whether the salesman travels from i to j in the final tour (see Section 1.3 of the textbook). One drawback of this classical formulation of the TSP is that its size is exponential in the size of the original problem description. It is possible, however, to obtain a polynomially-the original problem description....
View Full Document

This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .

Page1 / 2

ps2 - Homework 2 IE418 – Discrete Optimization Dr. Ralphs...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online