Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research · 2012 · Volume 60 · Issue 3
Abstract
In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source s i to destination t j , we incur a unit variable shipping cost of c ij and a fixed cost f ij . Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.
Keywords
fixed charge, transportation problem, integer programming, branch and cut
Enable JavaScript for citation tools and additional paper interactions.