The bounds of iteration number of some decomposition algorithms for solving plant location problems
The paper continues study of bounds of the number of algorithms'' iterations based on Benders decomposition for solving some famous plant location problems. New results for p-uncapacitated plant location problem and its modification are given, witch demands that each open plant should serve at least one client.