Top | recent changes | Preferences

What is an integer linear program?

A LinearProgram, with additional constraints that restrict some of the variables to take on only integer values. The problem of solving integer linear programs is NP-hard.

Example: min-cost vertex cover

Input: a graph G=(V,E) with vertex costs c.
Goal: find a vertex cover S of minimum cost, where cost(S) = sum_{v in S} c(v).

Introduce a variable x(v) for each vertex v.

Minimize v c(v) x(v) subject to:
x(v) ≥ 0 for each vertex v ∈ V.
x(u)+x(v) ≥ 1 for each edge (u,v) ∈ E.
x(v) takes on only integer values for each v. (integrality constraints)

prove: each feasible solution x corresponds to a vertex cover S such that cost(x) = cost(S). (cost(x) denotes the objective function value).

prove: the optimal solution corresponds to a min-cost vertex cover.

Top | recent changes | Preferences
This page is read-only | View other revisions
Last edited January 23, 2004 4:02 pm by NealYoung (diff)