We present an algorithm for assigning off-chip 1/0 pads for a logic circuit. The technique which is based on the analysis of the circuit structure and path delay constraints, uses linear placement, goal-programming, linear-sum assignment and 1/0 p a d clustering to assign locations to 1/0 pads. The 1/0 p a d assignment is then used b y placement tools. Experimental data shows that as a result o...

The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment Problem and give polynomial time procedures to check whether or not an instance is an element of these classes. © 2011 Elsevier B.V. All rights reserved.

In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks. Firstly, we propose separate linear programming (LP) formulations for the lightpath routing and the wavelength assignment subproblems. Then, an iterative algorithm that integrates both formulations is also proposed for solving the complete RWA problem. The objective...