## Commodity Representations and Cut-Set-Based Inequalities for Multicommodity Capacitated Fixed-Charge Network Design

- Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron
- Transportation Science
- 2017

Highly Influenced

@article{Atamtrk2001FlowPF, title={Flow pack facets of the single node fixed-charge flow polytope}, author={Alper Atamt{\"u}rk}, journal={Oper. Res. Lett.}, year={2001}, volume={29}, pages={107-114} }

- Published 2001 in Oper. Res. Lett.
DOI:10.1016/S0167-6377(01)00100-6

i∈N yi ≤ b, yi ≤ uixi ∀i ∈ N}, where variable yi is the flow on arc i with capacity ui, xi is a binary variable that indicates whether arc i is open or closed, and N = N ∪N. The single node fixed–charge flow model is interesting not only because it is a relaxation of the fixed–charge network flow problem, but also because it is possible to derive relaxations of the form S of a general MBIP problem. Therefore, valid inequalities for S can be used as cutting planes in branch–and–cut algorithms to… CONTINUE READING

36 Citations

14 References

Similar Papers