The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
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 (MIP) software too...
Saved in:
Main Authors: | , , |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2018
|
Subjects: | |
Online Access: | https://doaj.org/article/7775b4131a8a4365948123c9547ea651 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|