We consider an extension o f the Split Delivery Vehicle R outing Problem , whereby custom ers may have a tim e window on their delivery. A construction heuristic is developed which uses a look-ahead approach to solve the Split Delivery Vehicle Scheduling Problem with T im e W indow s. T w o im provem ent heuristics are also given: one attem pts to m ove custom ers between routes, while the othe...

Consider N entities to be classified (e.g., geographical areas), a matrix of dissimilarity between pairs of entities, a graph H with vertices associated with these entities such that the edges join the vertices corresponding to contiguous entities. The split of a cluster is the smallest dissimilarity between an entity of this cluster and an entity outside of it. The single-linkage algorithm (ig...

Transmission through split ring resonator SRR structures loaded with capacitors is investigated both experimentally and numerically. Magnetic resonance frequency m is observed to shift to lower frequencies when capacitors are mounted to the various capacitive regions of the SRR structure. The amount of change in m depends strongly on the place where the capacitors are loaded. The magnetic reson...

The smaller subparticle of rabbit reticulocyte ribosomes was shown to yield core-particle and split-protein fractions on treatment with 2.5 M-NH4Cl/61 mM-MgCl2. The core-particle fraction was inactive in poly(U)-directed polyphenylalanine synthesis, but activity was restored after recombination with the split-protein fraction. Optimum ionic conditions for the reconstruction of active subparticl...

We discuss matrix partition problems for graphs that admit a partition into k independent sets and ` cliques. We show that when k + ` 6 2, any matrix M has finitely many (k, `) minimal obstructions and hence all of these problems are polynomial time solvable. We provide upper bounds for the size of any (k, `) minimal obstruction when k = ` = 1 (split graphs), when k = 2, ` = 0 (bipartite graphs...

In this paper, we apply Theorem 3.2 of [G. M. Lee, L.-J. Lin, J. Nonlinear Convex Anal., 18 (2017), 1781–1800] to study the variational inequality over split equality fixed point problems for three finite families of strongly quasi-nonexpansive mappings. Then we use this result to study variational inequalities over split equality for three various finite families of nonlinear mappings. We give...

The muscarinic M(2) receptor was split at the third cytoplasmic loop into two fragments: the one containing the first five transmembrane regions and the N-terminal part of the third cytoplasmic loop was named M(2trunk), while the other, which contained the last two transmembrane regions and the C-terminal part of the third cytoplasmic loop, was named M(2tail). As seen in many other G protein-co...

A graph G = (V,E) is a unipolar graph if there exits a partition V = V1 ∪ V2 such that, V1 is a clique and V2 induces the disjoint union of cliques. The complement-closed class of generalized split graphs are those graphs G such that either G or the complement of G is unipolar. Generalized split graphs are a large subclass of perfect graphs. In fact, it has been shown that almost all C5-free (a...