Search
Now showing items 1-2 of 2
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 ...
Solving the simple plant location problem using a data correcting approach
(2003-10-20)
The Data Correcting Algorithm is a branch and bound type algorithm in which the data of
a given problem instance is ‘corrected’ at each branching in such a way that the new instance will be
as close as possible to a ...