Integer programming in VLSI design
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- A decomposition algorithm for circuit routing
- A new polynomial-time algorithm for linear programming
- Global wire routing in two-dimensional arrays
- Multiterminal global routing: A deterministic approximation scheme
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Six Standard Deviations Suffice
- ``Integer-making theorems
Cited in
(13)- scientific article; zbMATH DE number 125488 (Why is no real title available?)
- Multicommodity network flows: a survey. I: Applications and formulations
- VLSI circuit performance optimization by geometric programming
- Efficient preprocessing for VLSI optimization problems
- Global wire routing in two-dimensional arrays
- scientific article; zbMATH DE number 1830745 (Why is no real title available?)
- Algorithms and Computation
- Global routing in VLSI design: algorithms, theory, and computational practice
- OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing
- An ILP based hierarchical global routing approach for VLSI ASIC design
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- Some integer programs arising in the design of main frame computers
- scientific article; zbMATH DE number 3970689 (Why is no real title available?)
This page was built for publication: Integer programming in VLSI design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201818)