Search
Now showing items 1-10 of 27
Assessment of patient classification in appointment system design
(Production and Operations Management Society, 2008-05)
This paper investigates two approaches to patient classification: using patient classification only for sequencing patient appointments at the time of booking and using patient classification for both sequencing and ...
Ambulance location for maximum survival
(Wiley, 2008-02)
This article proposes new location models for emergency medical service stations. The models are generated by incorporating a survival function into existing covering models. A survival function is a monotonically decreasing ...
Computational comparison of five maximal covering models for locating ambulances
(Wiley, 2009-01)
This article categorizes existing maximum coverage optimization models for locatingambulances based on whether the models incorporate uncertainty about (1) ambulanceavailability and (2) response times. Data from Edmonton, ...
Optimal ambulance location with random delays and travel times
(Springer Science+Business Media, 2008-09)
We describe an ambulance location optimization model that minimizes the number of ambulances needed tonprovide a specified service level. The model measures service level as the fraction of calls reached within a given ...
Approximating vehicle dispatch probabilities for emergency service systems with location-specific service times and multiple units per location
(Informs, 2009-02)
To calculate many of the important performance measures for an emergency response system, one requires knowledge of the probability that a particular server will respond to an incoming call at a particular location. ...
A Lagrangian relaxation approach to large-scale flow interception problems
(Elsevier, 2009-10-16)
The paper presents a tight Lagrangian bound and an efficient dual heuristic for the flow interception problem. The proposed Lagrangian relaxation decomposes the problem into two subproblems that are easy to solve. Information ...
Pseudoscalar-meson-octet-baryon coupling constants in two-flavor lattice QCD
(American Physical Society, 2009-04-01)
We evaluate the πΝΝ, π∑∑, πΛ∑, KΛN and K∑N coupling constants and the corresponding monopole masses in lattice QCD with two flavors of dynamical quarks. The parameters representing the SU(3)-flavor symmetry are computed ...
Spin content of Λ in QCD sum rules
(American Physical Society, 2009-06-01)
We calculate the isoscalar axial-vector coupling constants of the Λ hyperon using the method of QCD sum rules. A determination of these coupling constants reveals the individual contributions of the u, d, and the s quarks ...
Optimal solution of the discrete cost multicommodity network design problem
(Elsevier, 2008-10-15)
We investigate a multicommodity network design problem where a discrete set of Technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design ...
Heuristics for the variable sized bin-packing problem
(Elsevier, 2009-10)
We investigate the one-dimensional variable-sized bin-packing problem. This problem requires packing a set of items into a minimum-cost set of bins of unequal sizes and costs. Six optimization-based heuristics for this ...
Share this page
