The Transportation Problem with Exclusionary Side Constraints

8 Pages Posted: 16 Dec 2005

See all articles by Dries Goossens

Dries Goossens

Catholic University of Leuven (KUL)

Frits Spieksma

Catholic University of Leuven (KUL)

Abstract

We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We determine the complexity status for each of two special cases of this problem, by proving NP-completeness, and by exhibiting a pseudo-polynomial time algorithm. For the general problem, we show that it cannot be approximated with a constant performance ratio in polynomial time (unless P=NP). These results settle the complexity status of the TPESC.

Keywords: Transportation problem, Exclusionary side constraints, Complexity

Suggested Citation

Goossens, Dries and Spieksma, Frits, The Transportation Problem with Exclusionary Side Constraints. Available at SSRN: https://ssrn.com/abstract=870231 or http://dx.doi.org/10.2139/ssrn.870231

Dries Goossens (Contact Author)

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Frits Spieksma

Catholic University of Leuven (KUL) ( email )

Leuven, B-3000
Belgium

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
118
Abstract Views
954
Rank
424,928
PlumX Metrics