2489 search results - page 126 / 498 » On the Subgroup Distance Problem |
137
click to vote
EOR
2007
15 years 4 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
145
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
318
click to vote
FAW
2010
Springer
15 years 5 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
162
click to vote
CCCG
2010
15 years 5 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
137
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...