{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

View Full Document Right Arrow Icon
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 0 (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- sized formulation using a more subtle set of constraints. We do this by creating an
Image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern