A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
An efficient algorithm is provided for solving a class of linear programming problems containing a large set of distance constraints of the form and a small set of multivariable constraints of forms other than . This class of linear programming formulation is applicable to very large scale integration (VLSI) layout spacing problems, including hierarchy-preserving hierarchical layout compaction, layout compaction with symmetric constraints, layout compaction with attractive and repulsivedoi:10.1109/43.936378 fatcat:kpgs4rqtp5arhe3hkch2nysste