Now showing items 1-2 of 2
Quadratic assignment problem : linearizations and polynomial time solvable cases
(Bilkent University, 2006)
The Quadratic Assignment Problem (QAP) is one of the hardest combinatorial optimization problems known. Exact solution attempts proposed for instances of size larger than 15 have been generally unsuccessful even ...
Network design problems in wavelength division multiplexing optical networks
(Bilkent University, 2001)
In this study, we analyze the network design problem arising in Wavelength Division Multiplexing (WDM) networks where tra c is static, wavelength interchanging is allowed and the location and number of the wavelength ...