Search
Now showing items 1-7 of 7
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 ...
Obtaining near-optimal solutions for the binary knapsack problem
(2010-01-16)
In this paper we consider the well-known binary knapsack problem. We propose a method of embedding heuristicsi in a branch and bound framework to optain solutions with profits within a pre-specified quality parameter within ...
Neighborhood search heuristicsfor the uncapacitated facility location problem
(2010-01-16)
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 ...
Data correcting: a methodology for obtaining near-optimal solutions
(2010-01-16)
In this paper we concern ourselves with the problem of finding near optimal solutions to function that are not amenable to solution by analytic means. This means that given a function and a parameter ? away from the optimal ...
Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram
(2010-01-16)
The Data Correcting Algorithm (DCA) is a recursive branch and bound type algorithm, in which the data of a given instance is heuristically corrected at each branching in such a way that the new instance will be as close ...