Francisco Barahona, László Ladányi
RAIRO - Operations Research
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.
Francisco Barahona, László Ladányi
RAIRO - Operations Research
Francisco Barahona
Physical Review B
Parijat Dube, Joao P.M. Goncalves, et al.
WSC 2014
Alan E. Rosenbluth, David O. Melville, et al.
SPIE Advanced Lithography 2009