Efficient preprocessing for VLSI optimization problems

DOI10.1007/s10589-008-9175-8zbMath1189.90102OpenAlexW2086286112MaRDI QIDQ967209

Tamás Terlaky, M. J. J. Liu, Warren L. Hare

Publication date: 28 April 2010

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-008-9175-8

zbMATH Keywords

VLSI design

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05)

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• A hierarchical algorithm for making sparse matrices sparser
• Presolving in linear programming
• An ILP based hierarchical global routing approach for VLSI ASIC design
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

This page was built for publication: Efficient preprocessing for VLSI optimization problems