Scribd
Upload
3 views

Spring2425 IE303 Recitation VI (1)

The document contains recitation questions for IE 303 Modeling and Methods in Optimization at Bilkent University, focusing on integer programming formulations for the symmetric traveling salesperson problem (STSP), 1-tree and STSP bounds, and the Knight's Tour problem. It includes tasks such as deriving the 2-Matching formulation, adding constraints, and applying greedy heuristics to find optimal solutions. Additionally, it discusses the formulation of the Knight's Tour problem using integer programming principles.

Uploaded by

emreuyan52
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Spring2425 IE303 Recitation VI (1)

The document contains recitation questions for IE 303 Modeling and Methods in Optimization at Bilkent University, focusing on integer programming formulations for the symmetric traveling salesperson problem (STSP), 1-tree and STSP bounds, and the Knight's Tour problem. It includes tasks such as deriving the 2-Matching formulation, adding constraints, and applying greedy heuristics to find optimal solutions. Additionally, it discusses the formulation of the Knight's Tour problem using integer programming principles.

Uploaded by

emreuyan52
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

IE 303 Modeling and Methods in

Optimization

Recitation VI Questions

Bora Çetin
Emir Doğan

Bilkent University
Department of Industrial Engineering
Spring 2024-2025
IE 303 Recitations

Question 1 (STSP Formulations)


There are few main integer programming formulations that are used to solve the sym-
metric traveling salesperson problem. In this question use the graph below to derive
The 2-Matching formulation. Let edge weights to be ce > 0, ∀e ∈ E.

A B

G E F

D C

a) Explain why the The 2-Matching formulation is only a relaxation to STSP. What
potential cases could arrive that we cannot find the optimal solution?

b) Based on the formulation you have derived, explicitly add the three subtour
elimination constraints.

c) Now, instead of subtour elimination constraints, add three connectivity con-


straints.

d) In an arbitrary graph with N-many vertices, what is the (approximately) max-


imum number of subtour elimination constraints you can generate? Instead of
adding all of the subtour elimination constraints at the beginning, what would
be a good strategy to implement to find the optimal STSP solution?

e) Lastly, combine 1-tree and 2-matching problems


P to find the TSP. 1-tree problem
formulation has the following constraint e∈E(C) xe = |V |, why this becomes
redundant when the two formulations are combined?

1 April 11, 2025


IE 303 Recitations

Question 2 (1-Tree and STSP Bounds)


9 5 6
1 3 6 8

6 7 14
8 8
10 4 7 10
7

12 8
4 8
2 5 9
8 13

• Using the greedy heuristic, find the optimal min-weight 1-tree from this graph.
Here use Node 1 as the anchor. What do you expect STSP solution to be com-
pared to the 1-tree solution?

• Now run the same heuristic with Node 9 being the anchor. Is this a better bound
compared to the one in part a)?

Question 3 (Knight’s Tour)


Euler wrote a challenging traveling salesperson problem in chess. Think of a regular
8×8 chess board. Assume that there is a single knight on the board and we want to this
knight to travel all of the squares using by minimizing the number of moves it takes.
How can you formulate this problem using integer programming? (Hint: Thinking the
chess board as a graph would be a nice start!)

2 April 11, 2025

You might also like