Sarah Jean Hood, Stuart Bermon, et al.
IEEE Trans Semicond Manuf
We study the network loading problem, with and without bifurcations. We use a relaxation based on the cut condition for multicommodity flows. We use a solution of the bifurcated case to derive a solution to the nonbifurcated problem. A standard procedure is to aggregate the problem into a backbone network. We applied this method to backbone networks coming from practical instances; we obtained feasible solutions and bounds for the gap from optimality.
Sarah Jean Hood, Stuart Bermon, et al.
IEEE Trans Semicond Manuf
Alan E. Rosenbluth, David O. Melville, et al.
SPIE Advanced Lithography 2009
Mourad Baïou, Francisco Barahona, et al.
Mathematics of Operations Research
Mourad Baiou, Francisco Barahona
Algorithmica