Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Authors:
- 1 June 2012
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 60 (3) , 638-654
Abstract
In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source si to destination tj, we incur a unit variable shipping cost of cij and a fixed cost fij. 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
This publication has 18 references indexed in Scilit:
- k-Partition-based facets of the network design problemNetworks, 2006
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problemNetworks, 2003
- Flow pack facets of the single node fixed-charge flow polytopeOperations Research Letters, 2001
- Lifted flow cover inequalities for mixed 0-1 integer programsMathematical Programming, 1999
- A set covering reformulation of the pure fixed charge transportation problemDiscrete Applied Mathematics, 1994
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problemsEuropean Journal of Operational Research, 1993
- Use of penalties in a branch and bound procedure for the fixed charge transportation problemEuropean Journal of Operational Research, 1989
- On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}Mathematical Programming, 1989
- Valid inequalities for mixed 0–1 programsDiscrete Applied Mathematics, 1986
- Some branch‐and‐bound procedures for fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1984