Integer Programming Models (3)

Assignment 4, Combinatorial Optimization,

Spring Semester, 2024

Aleksandar Shurbevski
Instructor (write your student ID here)
a_shurbevski@kcg.edu

1 Problem
A post office needs to plan collection routes for postboxes.
Denote the set of post boxes as {P1 , P2 , . . . , Pm }.
The post office has several candidate routes, {R1 , R2 , . . . , Rn }.
Introduce indicator constraints ai,j
(
1 Route Ri includes post box Pj
ai,j = i ∈ {1, 2, . . . , n}, j ∈ {1, 2, . . . , m}.
0 Otherwise

In addition, each route Ri has cost ci . Give an integer programming formulation

for the problem of determining which routes to use to minimize the collection cost
such that each post box is included in exactly one route.

2 Solution
We write a final complete formulation:

Minimize: X
ci · x i
i∈{1,2,...,n}

Subject to:
X
ai,j · xi = 0 j ∈ {1, 2, . . . , m}
i∈{1,2,...,n}

xi ∈ {0, 1} i ∈ {1, 2, . . . , n}