We study a single-product periodic-review inventory model in which the ordering quantity is either zero or at least a minimum order size+ The ordering cost is a linear function of the ordering quantity, and the demand in different time periods are independent random variables+ The objective is to characterize the inventory policies that minimize the total discounted ordering, holding, and backo...

In this paper, we propose a clustering based linear ordering algorithm which consists of global ordering and local ordering. In the global ordering, the algorithm forms clusters from n given vertices and orders the clusters. In tlhe local ordering, the elements in each cluster are linearly ordered. The linear order, thus produced, is used to obtain optimal k-way partitioning based on scaded cos...

This paper considers deception in the context of ordering genetic algorithms (GAs). Order-four deceptive ordering problems are designed for absolute and relative ordering decoding. Three different crossover operators are used in both absolute and relative ordering problems, and for each combination of crossover operator and coding, the schema survival probability is calculated. Simulation resul...

PURPOSE The purpose of this study is to clarify the lobe-specific nodal metastasis and optimal range of mediastinal nodal dissection in lung cancer patients with skip metastasis. MATERIALS AND METHODS A total of 136 patients with pN2/3 disease were treated between 1988 and 2002, and these patients were divided into two groups according to whether skip metastasis was identified or not. We drew...

We analyzed data from 54 newly-diagnosed persons with extra-nodal natural killer/T-cell (NK/T) lymphoma, who had a pretreatment 18F-FDG PET/CT study, to determine whether the sum of SUVmax of all the nodal and extra-nodal lesions predicted progression-free survival (PFS) and/or overall survival (OS). Three models (WB1SUVmax, WB2SUVmax, WB3SUVmax) based on the basis of the sum of SUVmax of the w...

Divide-and-conquer approximation algorithms for vertex ordering problems partition the vertex set of graphs, compute recursively an ordering of each part, and “glue” the orderings of the parts together. The computed ordering is specified by a decomposition tree that describes the recursive partitioning of the subproblems. At each internal node of the decomposition tree, there is a degree of fre...

Multiobjective optimization problems with a variable ordering structure instead of a partial ordering have recently gained interest due to several applications. In the last years a basic theory has been developed for such problems. The difficulty in their study arises from the fact that the binary relations of the variable ordering structure, which are defined by a cone-valued map which associa...

In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This problem, which has applications in graph drawing for example, is shown to be NP-hard, and remains NP-hard for bipartite simple graphs with maximum degree six. We then describe and analy...

In myelinated axons, most of the voltage-gated ion channels are concentrated at the nodes of Ranvier, which are short gaps in the myelin sheath. This arrangement leads to saltatory conduction and a larger conduction velocity than in nonmyelinated axons. Intriguingly, axons in the peripheral nervous system that exceed about 2 μm in diameter exhibit a characteristic narrowing of the axon at nodes...

The compiler optimization phase ordering not only possesses challenges to compiler developer but also for multithreaded programmer to enhance the performance of Multicore systems. Many compilers have numerous optimization techniques which are applied in predetermined ordering. These ordering of optimization techniques may not always give an optimal code further it is impossible to find a unanim...