A decomposition algorithm for circuit routing-Reference-Cited by-同舟云学术

A decomposition algorithm for circuit routing

Published:1985 Issue: Volume: Page:87-103
ISSN:0303-3929
Container-title:Mathematical Programming Essays in Honor of George B. Dantzig Part I
language:
Short-container-title:

Author:

Hu T. C.,Shing M. T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0121044.pdf

Reference26 articles.

1. M. Breuer, “Min-cut placement”, Journal of Design Automation and Fault Tolerant Computing 1 (1976) 343–362.

2. K.A. Chen, M. Feuer, K.H. Khokhani, N. Nan and S. Schmidt, “The chip layout problem: an automatic wiring procedure”, Proceedings of 14th Design Automation Conference (1977) 298–302.

3. H. Crowder, E.L. Johnson and M.W. Padberg, “Solving large-scale zero-one linear programming problems”, Journal of ORSa 31(5) (1983) 803–834.

4. G.B. Dantzig, “Maximization of a linear function of variables subject to linear inequalities”, in: T.C. Koopman, ed., Activity analysis of production and allocation (John Wiley & Sons, 1951) pp. 339–347.

5. G.B. Dantzig, Linear programming and its extensions (Princeton University Press, Princeton, NJ, 1963).

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

1. Influence of Professor T. C. Hu's Works on Fundamental Approaches in Layout;Proceedings of the 2018 International Symposium on Physical Design;2018-03-25

2. Tree Structures and Algorithms for Physical Design;Proceedings of the 2018 International Symposium on Physical Design;2018-03-25

3. Integer Linear Programming Models for Global Routing;INFORMS Journal on Computing;2006-05

4. Robust methods for EMC-driven routing;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;1994

5. The pin redistribution problem in multi-chip modules;Mathematical Programming;1994-01