Title: The transportation problem with exclusionary side constraints
Authors: Goossens, Dries ×
Spieksma, Frederik #
Issue Date: Mar-2009
Publisher: Springer
Series Title: 4OR: a Quarterly Journal of Operations Research vol:7 issue:1 pages:51-60
Abstract: We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We confirm that the TPESC is NP-hard, and we analyze the complexity of different special cases. For instance, we show that in case of a bounded number of suppliers, a pseudo-polynomial time algorithm exists, whereas the case of two demand nodes is already hard to approximate within a constant factor (unless P = NP).
ISSN: 1619-4500
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
Goossens Spieksma - TPESC.pdf Published 172KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science