The Transportation Problem with Exclusionary Side Constraints
8 Pages Posted: 16 Dec 2005
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: 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
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.