A decomposition algorithm for circuit routing

From MaRDI portal

Revision as of 09:23, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3710289

Jump to:navigation, search

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 program decomposition principle Circuit routing cut paste approach large 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 (5)

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

This page was built for publication: A decomposition algorithm for circuit routing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3710289&oldid=17211823"