On a Cardinality-Constrained Transportation Problem With Market Choice
Optimization and Control
2014-12-31 v1 Data Structures and Algorithms
Abstract
It is well-known that the intersection of the matching polytope with a cardinality constraint is integral [8]. We prove a similar result for the polytope corresponding to the transportation problem with market choice (TPMC) (introduced in [4]) when the demands are in the set . This result generalizes the result regarding the matching polytope and also implies that some special classes of minimum weight perfect matching problem with a cardinality constraint on a subset of edges can be solved in polynomial time.
Cite
@article{arxiv.1412.8723,
title = {On a Cardinality-Constrained Transportation Problem With Market Choice},
author = {Pelin Damci-Kurt and Santanu S. Dey and Simge Kucukyavuz},
journal= {arXiv preprint arXiv:1412.8723},
year = {2014}
}