90,178 research outputs found
Asymmetric binary covering codes
An asymmetric binary covering code of length n and radius R is a subset C of
the n-cube Q_n such that every vector x in Q_n can be obtained from some vector
c in C by changing at most R 1's of c to 0's, where R is as small as possible.
K^+(n,R) is defined as the smallest size of such a code. We show K^+(n,R) is of
order 2^n/n^R for constant R, using an asymmetric sphere-covering bound and
probabilistic methods. We show K^+(n,n-R')=R'+1 for constant coradius R' iff
n>=R'(R'+1)/2. These two results are extended to near-constant R and R',
respectively. Various bounds on K^+ are given in terms of the total number of
0's or 1's in a minimal code. The dimension of a minimal asymmetric linear
binary code ([n,R]^+ code) is determined to be min(0,n-R). We conclude by
discussing open problems and techniques to compute explicit values for K^+,
giving a table of best known bounds.Comment: 16 page
A taxonomy for emergency service station location problem
The emergency service station (ESS) location problem has been widely
studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. However, there is not any study that systematically classifies different problem types and methodologies to address them. This paper presents a taxonomic framework for the ESS location problem using an operations research perspective. In this framework, we basically
consider the type of the emergency, the objective function, constraints, model
assumptions, modeling, and solution techniques. We also analyze a variety of papers related to the literature in order to demonstrate the effectiveness of the taxonomy and to get insights for possible research directions
- …