Results 251 to 260 of about 282,015 (284)

A maximal cover of hexagonal systems

Graphs and Combinatorics, 1985
The author proves the following theorem: ''Let H be a peri-condensed HS and K be a cover with maximum cardinality. Then \(H\setminus K\) has a unique 1-factor''. Here is used the following terminology: A hexagonal unit cell is a plane region bounded by a regular hexagon of side length 1. A hexagonal system (HS) is a finite connected plane graph with no
Zheng, Maolin, Chen, Rongsi
openaire   +1 more source

The generalized maximal covering location problem

Computers & Operations Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berman, Oded, Krass, Dmitry
openaire   +2 more sources

Maximal Inequalities and Covering Numbers

1996
In this chapter we derive a class of maximal inequalities that can be used to establish the asymptotic equicontinuity of the empirical process. Since the inequalities have much wider applicability, we temporarily leave the empirical process framework.
Aad W. van der Vaart, Jon A. Wellner
openaire   +1 more source

Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem

2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2019
To benefit from the location advantages provided from two main covering location problems, namely set covering location problem and maximal covering location problem, a new mathematical model is presented in this study. In this model, the main facilities are located gradually through the planning periods, providing full coverage for the incremental ...
R. Alizadeh, T. Nishi
openaire   +1 more source

Maximally Disjoint Solutions of the Set Covering Problem

Journal of Heuristics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rader, David J., Hammer, Peter L.
openaire   +2 more sources

The maximal covering location disruption problem

Computers & Operations Research
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Dihedral coverings branched along maximizing sextics

Mathematische Annalen, 1997
Let \(C\) be a maximizing sextic. We study a \({\mathcal D}_{2p}\) (\(p\): odd prime) covering of \(\mathbb{P}^2\) branched along \(C\). Suppose that \(C\) is irreducible and has at least one triple point. Then, for \(p\geq 5\), there is no \({\mathcal D}_{2p}\) covering branched along \(C\).
openaire   +2 more sources

The hierarchical hub maximal covering problem with determinate cover radiuses

2010 IEEE International Conference on Industrial Engineering and Engineering Management, 2010
Hierarchical facility location problems with three levels deal with location of facilities in any level and assignment traffic to given routing. Hub covering problems covered the demand nodes, if they are within a particular radius of a facility that can supply their demand.
R. Sahraeian, E. Korani
openaire   +1 more source

Minimal Coverings of Maximal Partial Clones

2009 39th International Symposium on Multiple-Valued Logic, 2009
A partial function f on a k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to no maximal partial clone on Ek, a characterization of partial Sheffer functions reduces to finding families of minimal coverings of maximal partial clones on Ek.
openaire   +1 more source

Maximal Covering Location Games: An Application for the Coast Guard

2018
It is well-known that maximal covering location games may have empty cores. In Schlicher et al. (2017) several sufficient conditions for core non-emptiness are derived for these games. In this chapter, we present another sufficient condition for core non-emptiness, which also has a practical interpretation when dealing with a real-life application of ...
openaire   +2 more sources