Abstract
Multicommodity extended formulations of single source uncapacitated fixed charge network flow problems have significantly sharper linear programming relaxations than the standard flow formulations. However the tradeoff is the introduction of many new constraints and variables to accomodate a sink-oriented flow disaggregation. In this paper we introduce a new family of dicut collection inequalities and show that they completely describe the projection of the multicommodity formulation onto the original variables. A simple subclass is seen to include a variety of known inequalities for particular models, and combinatorial separation is examined for some special cases.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
