Steiner tree packing revisited-Reference-Cited by-同舟云学术

Steiner tree packing revisited

Published:2012-05-15 Issue:1 Volume:76 Page:95-123
ISSN:1432-2994
Container-title:Mathematical Methods of Operations Research
language:en
Short-container-title:Math Meth Oper Res

Author:

Hoàng Nam-Dũng,Koch Thorsten

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/s00186-012-0391-8.pdf

Reference26 articles.

1. Achterberg T, Raack C (2010) The MCF-separator—detecting and exploiting multi-commodity flows in MIPs. Math Program C, pp 125–165

2. Balas E, Martin C (1980) Pivot and complement—a heuristic for 0/1 programming. Manag Sci 26: 86–96

3. Balas E, Schmietab S, Wallacea C (2004) Pivot and shift—a mixed integer programming heuristic. Discret Optim 1: 3–12

4. Boit C (2004) Personal communication

5. Brady ML, Brown DJ (1984) VLSI routing: four layers suffice. In: Preparata FP (ed) Advances in computing research: VLSI theory. Jai Press, London, pp 245–258

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

1. BonnCell: Automatic Cell Layout in the 7-nm Era;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2020-10

2. The cavity approach for Steiner trees packing problems;Journal of Statistical Mechanics: Theory and Experiment;2018-12-07

3. Automatic Cell Layout in the 7nm Era;Proceedings of the 2017 ACM on International Symposium on Physical Design;2017-03-19

4. How Many Steiner Terminals Can You Connect in 20 Years?;Facets of Combinatorial Optimization;2013