Search
Now showing items 1-10 of 30
Solving medium to large sized euclidean generalized minimum spanning tree problems
(2010-07-14)
The generalized minimum spanning tree problem is a generalization of the minimum
spanning tree problem. This network design problems finds several practical applications,
especially when one considers the design of a ...
Spotting difficult weakly correlated binary knapsack problems
(2010-04-16)
We examine in this paper that the possibility of quickly deciding whether or not an instance of a binary knapsack problem is difficult for branch and bound algorithms. We first observe that the distribution of the objective ...
An empirical investigation into randomly generated euclidean symmetric traveling salesman problems
(2010-07-22)
The traveling salesman problem is one of the most well-solved hard combinatorial optimization problems. Any new algorithm or heuristic for the traveling salesman problem is empirically evaluated based on its performance ...
On the Blowout Preventer Testing Problem: An approach to checking for leakage in BOP networks
(2013-11-20)
Blowout Preventers (BOPs) and choke manifolds are key pieces of drilling rig equipment
o prevent the uncontrolled release of potentially hazardous formation
uids to surface. The
blowout prevention testing problem is ...
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods
(2013-11-20)
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 ...
Identifying defective valves in a blowout preventer valve network
(2013-11-26)
Blowouts are nancially damaging for drilling companies and are ecological hazards. Hence
blowout prevention equipment is critical infrastructure for drilling companies. Blowout preventer
valves are important components ...
A Lin-Kernighan heurisitic for single row facility layout
(2013-11-25)
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 ...
Population Heuristics for the Corridor Allocation Problem
(2013-11-22)
The corridor allocation problem is one of assigning a given set of facilities in two rows
along a straight corridor so as to minimize a weighted sum of the distances between every
pair of facilities. This problem has ...
A competitive genetic algorithm for single row facility layout
(2013-11-25)
The single row facility layout is the NP-Hard problem of arranging facilities with given
lengths on a line, so as to minimize the weighted sum of the distances between all pairs of
facilities. Owing to the computational ...
Path relinking for single row facility layout
(2013-11-22)
The single row facility layout problem 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. In ...