Search
Now showing items 1-8 of 8
Sensitivity analysis of the greedy heuristic for binary knapsack problems
(2006-10-27)
Greedy heuristics are a popular choice of heuristics when we have to solve
a large variety of N P-hard combinatorial problems. In particular for binary
knapsack problems, these heuristics generate good results. If some ...
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 ...
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 ...
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
(2005-10-27)
Maximization of submodular functions on a ground set is a NP-hard combinatorial
optimization problem. Data correcting algorithms are among the several algorithms suggested
for solving this problem exactly and approximately. ...
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 ...
Large Point Source (LPS) emissions from India: regional and sectoral analysis, atmospheric environment
(2001-10-18)
Indian large point sources (LPS) contribute to CO2 andSO2 emissions to a large extent (above 65%) andto CH4,
N2O andNOX emissions to some extent (around10%). The former emissions are primarily from fossil fuel combustion
while ...