Polyhedral Methods for the Max-Cut Problem
Final rept. 1 Jun 1990-31 May 1991,
RICE UNIV HOUSTON TX DEPT OF MATHEMATICAL SCIENCES
Pagination or Media Count:
New polyhedral methods have been developed for the solution of a class of programming problems of importance in VLSI design. There methods have made possible an order-of-magnitude increase in the size of problems that can be successfully solved.
- Numerical Mathematics
- Computer Programming and Software