In this paper, a single-vendor and multiple-buyers’ integrated production inventory model is investigated where demand of the item at buyers’ location considered as interval type-2 fuzzy number (IT2FN). Deterioration rate assumed to change in accordance with weather conditions particular region. It relies upon values certain attributes that have direct influence on extent deterioration. These p...

In this paper, we present an efficient algorithm for fast nearest-neighbour search in multidimensional space under a so called approximation-elimination framework. The algorithm is based on a new approximation procedure which selects codevectors for distance computation in the close proximity of the test vector and eliminates codevectors using the triangle inequality based elimination. The algo...

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approximation}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of Euclidean distance. Previous algorithms based on these elimination rules are reviewed in the cont...

We investigate the possibility of ferromagnetic ordering in non-degenerate Hubbard model on face-centered cubic lattice within functional renormalization group technique using temperature as a scale parameter. assume relations between nearest, next-nearest, and next-next-nearest hopping parameters providing higher order (giant) van Hove singularity density states. The instability formation with...

Most natural language processing tasks can be formulated as the approximated nearest neighbor search problem, such as word analogy, document similarity, machine translation. Take the questionanswering task as an example, given a question as the query, the goal is to search its nearest neighbor in the training dataset as the answer. However, existing methods for approximate nearest neighbor sear...

We consider bounded occurrence (degree) instances of a minimum constraint satisfaction problem MIN-LIN2 and a MIN-BISECTION problem for graphs. MIN-LIN2 is an optimization problem for a given system of linear equations mod 2 to construct a solution that sat-isses the minimum number of them. E3-OCC-MIN-E3-LIN2 is the bounded occurrence (degree) problem restricted as follows: each equation has ex...

In this paper, we present a general framework for the study of interval type-2 rough fuzzy sets by using both constructive and axiomatic approaches. First, several concepts and properties of interval type-2 fuzzy sets are introduced. Then, a pair of lower and upper interval type-2 rough fuzzy approximation operators with respect to a crisp binary relation is proposed. Classical representations ...

In this note, we establish that any interval or circular-arc graph with n vertices admits a partition into O(log n) proper interval subgraphs. This bound is shown to be asymptotically sharp for an infinite family of interval graphs. Moreover, the constructive proof yields a lineartime and space algorithm to compute such a partition. The second part of the paper is devoted to an application of t...