Bryan McNally

Rural-urban differences for integrated first responder and drone automated external defibrillator delivery in North Carolina

Jamal Chu, K.H. Benjamin Leung, Audrey L. Blewer, R. Darrell Nelson et autres

BACKGROUND: Early defibrillation for out-of-hospital cardiac arrest (OHCA) improves survival, but timely automated external defibrillator (AED) access remains challenging especially in rural areas. We conducted a computational modelling study to estimate how existing urban-rural differences in AED arrival would change for a …

ca, us (code pays fourni par la source)

Efforts to promote life-saving skills in Singapore and globally

Yih Yng Ng, Chi Keong Ching, Chiun How Teng, Yu-Chun Chien et autres

sg, jp, ph, gb, us (code pays fourni par la source)

Out-of-hospital cardiac arrest in three EMS centers in northern and central Thailand: a mixed-methods call for a national data infrastructure

Chanodom Piankusol, Nutcha Charoenboon, Natthanaphop Isaradech, Borwon Wittayachamnankul et autres

BACKGROUND: Out-of-hospital cardiac arrest (OHCA) is a leading cause of mortality in Thailand, yet national response to the issue remains fragmented and under-prioritized. There is no centralized OHCA registry, neurological outcome data are almost entirely absent, and coordination between EMS and hospitals …

us, th (code pays fourni par la source)

A Simple Methodology that Efficiently Generates All Optimal Spanning Trees for the Cable-Trench Problem

Francis Joseph Vasko, Yun Lu, Bryan McNally

The Cable-Trench Problem (CTP) is defined as a combination of the Shortest Path and Minimum Spanning Tree Problems. Specifically, let G = (V , E) be a connected weighted graph with specified vertex v1 ∈ V (referred to as the root), length …

us (code pays fourni par la source)

A Simple and Efficient Technique to Generate Bounded Solutions for the Multidimensional Knapsack Problem: a Guide for OR Practitioners

Yun Lu, Bryan McNally, Emre Shively‐Ertas, Francis Joseph Vasko

The 0-1 Multidimensional Knapsack Problem (MKP) is a NP-Hard problem that has important applications in business and industry. Approximate solution approaches for the MKP in the literature typically provide no guarantee on how close generated solutions are to the optimum. This article …

us (code pays fourni par la source)

A Simple and Efficient Technique to Generate Bounded Solutions for the Generalized Assignment Problem: A Guide for OR Practitioners

Francis Joseph Vasko, Anthony Dellinger, Yun Lu, Bryan McNally et autres

The generalized assignment problem (GAP) is a NP-hard problem that has a large and varied number of important applications in business and industry. Approximate solution approaches for the GAP do not require excessive computation time, but typically there are no guarantees on …

us (code pays fourni par la source)

A Simple and Efficient Technique to Generate Bounded Solutions for the Generalized Assignment Problem: A Guide for OR Practitioners

Francis Joseph Vasko, Anthony Dellinger, Yun Lu, Bryan McNally et autres

The generalized assignment problem (GAP) is a NP-hard problem that has a large and varied number of important applications in business and industry. Approximate solution approaches for the GAP do not require excessive computation time, but typically there are no guarantees on …

us (code pays fourni par la source)

A Simple and Effective Methodology for Generating Bounded Solutions for the Set K-Covering and Set Variable K-Covering Problems: A Guide for or Practitioners

Bryan McNally, Yun Lu, Emre Shively‐Ertas, Myung Soon Song et autres

As generalizations of the classic set covering problem (SCP), both the set K-covering problem (SKCP) and the set variable (K varies by constraint) K-covering problem (SVKCP) are easily shown to be NP-hard. Solution approaches in the literature for the SKCP typically provide …