Search
Now showing items 1-3 of 3
Tolerance-based branch and bound algorithms for the ATSP
(2008-11-09)
The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost
values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances ...
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 ...
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 ...