Sciweavers

3656 search results - page 9 / 732
» Compact Location Problems
Sort
View
TRANSCI
2011
80views more  TRANSCI 2011»
13 years 3 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...
FOCS
2008
IEEE
13 years 9 months ago
Minimizing Movement in Mobile Facility Location Problems
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
Zachary Friggstad, Mohammad R. Salavatipour
CSSC
2008
62views more  CSSC 2008»
13 years 8 months ago
An Adaptive Test for the Two-Sample Location Problem Based on U-Statistics
For the two-sample location problem we consider a general class of tests, all members of it are based on U-statistics. The asymptotic efficicacies are investigated in detail. We c...
Wolfgang Kössler, N. Kumar
EOR
2010
102views more  EOR 2010»
13 years 8 months ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
EOR
2002
67views more  EOR 2002»
13 years 8 months ago
Solving the multiple competitive facilities location problem
In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in ...
Tammy Drezner, Zvi Drezner, Said Salhi