The covering radius R of a code is the maximal distance of any vector from the code. This work gives a number of new results concerning t[ n, k], the minimal covering radius of any binary code of length n and dimension k. For example r[ n, 41 and t [ n, 51 are determined exactly, and reasonably tight bounds on t[ n, k] are obtained for any k when n is large. These results are found by using sev...

Crossing structures are an effective method for mitigating habitat fragmentation and reducing wildlifevehicle collisions, although high construction costs limit the number that can be implemented in practice. Therefore, optimizing the placement of crossing structures in road networks is suggested as a strategic conservation planning method. This research explores two approaches for using the ma...

We consider the queueing maximal covering location-allocation problem QM-CLAP with an M/G/1 queueing system. We first formulate the problem as a binary quadratic programming problem and then propose a new solution procedure based on decomposition of the problem into smaller binary quadratic sub-problems. The heuristic procedure GRASP is used to solve the subproblems, as well as the entire model...

The maximal expected covering location problem (MEXCLP) and its adjusted counterpart (AMEXCLP) compute expected coverage arising only from unqueued calls, whereas the interactive use of the hypercube queueing model (HQM) considers both unqueued and queued calls in this computation. In this note we show that the three models are not strictly comparable because of the structural di=erences in the...

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In n-dimensional space, if the objects are polydisperse n-balls, we show that solutions correspond to sets of maximal n-balls. For polygons, we provide a heuri...

Abstract We study a family of discrete optimization problems asking for the maximization expected value concave, strictly increasing, and differentiable function composed with set-union operator. The is computed respect to set coefficients taking values from scenarios. models utility decision maker, while operator covering relationship between two ground sets, items metaitems. This problem gene...

With emergencies being, unfortunately, part of our lives, it is crucial to efficiently plan and allocate emergency response facilities that deliver effective and timely relief to people most in need. Emergency Medical Services (EMS) allocation problems deal with locating EMS facilities among potential sites to provide efficient and effective services over a wide area with spatially distributed ...

We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.