Search
Now showing items 21-30 of 45
Evaluating Downside Risks in Reliable Networks
(2011-05-27)
Reliable networks are those in which network elements have a positive probability of failing. Conventional performance measures for such networks concern themselves either with expected network performance or with the ...
Speeding Up the Estimation of Expected Maximum Flows through Reliable Networks
(2011-05-27)
This paper presents a strategy for speeding up the estimation of expected maximum flows through reliable networks. Computational experiments with the strategy on three types of randomly generated networks show that it ...
Discrete optimization: tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
(European Journal of Operational Research, 2013)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard. ...
Insertion based lin-kernighan heuristic for single row facility layout
(Elsevier Ltd, 2013)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known ...
A scatter search algorithm for the single row facility layout problem
(Springer, 2014)
The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The ...
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 ...