Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"VLSI Layout Problem"”.

  1. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems

    It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for these hard problems. Usually a <I>good</I> relaxation is one which can be …

    waterloo Repository record for New Convex Relaxations for the Maximum Cut and VLSI Layout Problems (opens in a new tab)