Search
Now showing items 1-1 of 1
Branch and peg algorithms for the simple plant location problems
(2003-10-20)
The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of
deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum
cost. This ...