A decomposition algorithm for circuit routing
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 87-103
- https://doi.org/10.1007/bfb0121044
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An effective structured approach to finding optimal partitions of networksComputing, 1982
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972
- Generalized upper bounding techniquesJournal of Computer and System Sciences, 1967
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966
- Large and nonconvex problems in linear programmingProceedings of Symposia in Applied Mathematics, 1963
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958