A decomposition algorithm for circuit routing

DOI10.1007/BFb0121044zbMath0584.90057OpenAlexW4694820MaRDI QIDQ3710289

No author found.

Publication date: 1985

Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part I (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121044

zbMATH Keywords

integer linear programdecomposition principleCircuit routingcut paste approachlarge linear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Decomposition methods (49M27)

Related Items

The pin redistribution problem in multi-chip modules, Global wire routing in two-dimensional arrays, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Integer programming in VLSI design