Definition (Maximal size complete bipartite induced subgraph). β(G) := size of maximal complete bipartite induced subgraph of G. Definition (Minimal bipartite decomposion number). τ(G) := minimal number of complete edge disjoint covering bipartite subgraphs of G. Definition (Minimal nontrivial bipartite decomposion number). τ (G) := minimal number of complete edge disjoint covering nontrivial (...

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...

the rings considered in this article are commutative with identity $1neq 0$. by a proper ideal of a ring $r$,  we mean an ideal $i$ of $r$ such that $ineq r$.  we say that a proper ideal $i$ of a ring $r$ is a  maximal non-prime ideal if $i$ is not a prime ideal of $r$ but any proper ideal $a$ of $r$ with $ isubseteq a$ and $ineq a$ is a prime ideal. that is, among all the proper ideals of $r$,...

We classify, up to isomorphism, maximal curves covered by the Hermit-ian curve H by a prime degree Galois covering. We also compute the genus of maximal curves obtained by the quotient of H by several automorphisms groups. Finally we discuss the value for the third largest genus that a maximal curve can have.

In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting (NESGA,) is introduced to identify equilibria for competitive maximal covering location problem with two and three competitors, which combinatorial game theory where it computationally intractable enumerate all decision options of competitors. Although GAs are widely used in optimization, their applications non-c...