In this paper we report on our Nov98 Hub-4E system, which is an extension of our Nov97 system[4]. The LIMSI system for the November 1998 Hub-4E evaluation is a continuous mixture density, tied-state cross-word context-dependent HMM system. The acoustic models were trained on the 1995, 1996 and 1997 official Hub-4E training data containing about 150 hours of transcribed speech material. 65K word...

The p-median problem is a graph theory problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated p-median problem on a graph or network.

Capacitated Centered Clustering problem (CPMP) is an important variation of p-median problems. The p-median problems are known to be NP-hard. A hybrid genetic algorithm is used to solve the problem efficiently. The analysis shows that the performance of the proposed algorithm is better than the traditional local search heuristic.

STUDY OBJECTIVE Assessment of the impact of the regionalisation of cardiac surgery through the organisational form of a hub&spoke model introduced in the year 2000. DESIGN Case mix adjusted before (1998-1999)-after (2000-2002) comparison of: (a) in-hospital and 30 days mortality rates; (b) proportion of patients timely (within one day) referred for surgery from spoke to hub centres; (c) patie...

The p-median problem is a graph theory problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated p-median problem on a graph or network.

BACKGROUND AND PURPOSE Acute stroke clinical trials are conducted primarily at academic medical centers. As a result, patients living in rural areas are excluded from participation, results may not be generalizable to nonacademic settings, and studies may be slow to recruit subjects. Telemedicine can provide rural patients with emergency neurovascular consultation. We sought to determine whethe...

This paper presents a discussion arisen after reading ”A hybrid genetic algorithm that optimizes capacitated vehicle routing problem”, by Chung-Ho Wang and Jiu-Zhang Lu, (2009). Expert System with Applications (35)(pp. 2921-2936). The discussed paper presents a hybrid genetic algorithm applied to the Capacitated Vehicle Routing Problem (CVRP). When the authors present the results obtained by th...

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated consider...

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from th...

This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective loc...