Search
Now showing items 1-4 of 4
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 ...
Binary knapsack problems with random budgets
(2003-10-21)
The binary knapsack problem is a combinatorial optimization problem in which a subset of a given set of elements
needs to be chosen in order to maximize profit, given a budget constraint. In this paper, we study a stochastic ...
Neighbourhood search heuristics for the uncapacitated facility location problem
(2003-10-22)
The uncapacitated facility location problem is one of choosing sites among a set of candidates in which facilities can
be located, so that the demands of a given set of clients are satisfied at minimum costs. Applications ...