نتایج جستجو برای: set partitioning
تعداد نتایج: 689813 فیلتر نتایج به سال:
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...
the facet of knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. strong covers for facets of knapsack ploytope has been developed in the first pa...
In this paper, we consider the production possibility set with n production units such that the following four principles that governs: inclusion observations, conceivability, immensity and convexity. Our goal is to estimate the output of a same and new production unit with existing production possibility and amount of input is specified. So, initially we find the interval changes of each input...
The number partitioning problem is to divide a given set of integers into a collection of subsets, so that the sum of the numbers in each subset are as nearly equal as possible. While a very efficient algorithm exists for optimal two-way partitioning, it is not nearly as effective for multi-way partitioning. We develop two new linear-space algorithms for multi-way partitioning, and demonstrate ...
Certain amount of retained austenite can increase ductility of steels because of the TRIP phenomenon during plastic deformation. One method for achieving this is partitioning of carbon into austenite to stabilize it at room temperature. The quenching and partitioning (Q&P) heat treatment leads to a microstructure consisting of martensite and stabilized retained austenite between martensite plat...
Feature set partitioning generalizes the task of feature selection by partitioning the feature set into subsets of features that are collectively useful, rather than by finding a single useful subset of features. This paper presents a novel feature set partitioning approach that is based on a genetic algorithm. As part of this new approach a new encoding schema is also proposed and its properti...
in this paper, we consider the production possibility set with n production units such that the following four principles that governs: inclusion observations, conceivability, immensity and convexity. our goal is to estimate the output of a same and new production unit with existing production possibility and amount of input is specified. so, initially we find the interval changes of each input...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید