Buscar
Mostrando ítems 1-10 de 265
Location-allocation of multiple-server service centers with constrained queues or waiting times
(KLUWER ACADEMIC PUBL, 2002)
Recently, the authors have formulated new models for the location of congested facilities, so to maximize population covered by service with short queues or waiting time. In this paper, we present an extension of these ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015-05-01)
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents ...
A branch and cut algorithm for the hierarchical network design problem
(ELSEVIER SCIENCE BV, 2010)
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting ...
Optimal location of multi-server congestible facilities operating as M/E-r/m/N queues
(TAYLOR & FRANCIS LTD, 2009)
Most models for location of immobile congested facilities assume exponentially distributed service time at the facilities. Although the resulting formulations are tractable, they do not adequately represent service time ...
Hierarchical location-allocation models for congested systems
(ELSEVIER SCIENCE BV, 2001)
In this paper we address the issue of locating hierarchical facilities in the presence of congestion. Two hierarchical models are presented, where lower level servers attend requests first, and then, some of the served ...
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015)