The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Sign Up to like & getrecommendations! Published in 2018 at "EURO Journal on Computational Optimization"
DOI: 10.1007/s13675-017-0091-5
Abstract: In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND). This algorithm combines bounding and branching procedures inspired by the latest developments in mixed-integer programming… read more here.
Keywords: branch cut; multicommodity capacitated; fixed charge; cut algorithm ... See more keywords