Date of Award

2010

Degree Type

Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Bandyopadhyay, Subir (School of Computer Science)

Keywords

Artificial Intelligence.

Rights

CC BY-NC-ND 4.0

Abstract

In optical networks, non-bifurcated traffic grooming is known to be a difficult problem, intractable for large networks. One approach is to use the branch and price technique, using the Arc-Chain representation. In this approach the GUB decomposition and implicit column generation can be used to speed up the optimization process. Our objective is to further optimize this approach using Eta Factorization to avoid inverting the basis during each iteration of the revised simplex method.

Share

COinS