The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs-Reference-Cited by-同舟云学术

The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs

Published:2010-06 Issue:2 Volume:2 Page:125-165
ISSN:1867-2949
Container-title:Mathematical Programming Computation
language:en
Short-container-title:Math. Prog. Comp.

Author:

Achterberg Tobias,Raack Christian

Publisher

Springer Science and Business Media LLC

Subject

Software,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s12532-010-0015-3.pdf

Reference61 articles.

1. Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universität Berlin. http://opus.kobv.de/tuberlin/volltexte/2007/1611/ (2007)

2. Achterberg, T., Raack, C.: The Mcf-separator—Detecting and Exploiting Multi-Commodity Flow Structures in MIPs. ZIB-Report 07-38, Konrad-Zuse-Zentrum für Informationstechnik Berlin. http://www.zib.de/ (2009)

3. Achterberg, T., Koch, T., Martin, A.: MIPLIB Oper. Res. Lett. 34(4):361–372, (2003). http://miplib.zib.de/ (2006)

4. Ahuja R., Magnanti T., Orlin J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)

5. Atamtürk A.: Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29, 107–114 (2001)

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Benders decomposition approach for planning home blood donations;Flexible Services and Manufacturing Journal;2024-02-20

2. Lifting for the integer knapsack cover polyhedron;Journal of Global Optimization;2022-12-07

3. Solving the pooling problem at scale with extensible solver GALINI;Computers & Chemical Engineering;2022-03

4. Progress in mathematical programming solvers from 2001 to 2020;EURO Journal on Computational Optimization;2022

5. An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron;Journal of Global Optimization;2021-01-04