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...

The cause of negative or reduced outflow formation at the beginning of a Muskingum solution is examined in two steps. The first step involves a physical interpretation of the Muskingum weighted discharge and the storage equation, using theory based on an extension of the Kalinin-Milyukov method. The second step involves the derivation of an analytical solution for the weighted discharge based o...

rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. in the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. with traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. four s...

In this paper, we will consider global routing and pin assignment in VLSI building block layout, and present an efficient algorithm which integrates global routing, pin assignment, block reshaping and positioning. The general flow of the proposed algorithm is the same as the one proposed in [1] and consists of two main phases. The first phase is to determine not only global routes and coarse pi...

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Its computational performance is compared with all available implementations of algorithms ...

Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function of the label difference. Exact inference in such labeling tasks is still difficult, and therefore approximate inference methods based on a linear programming ...

apigenin is best known as an irreversible inhibitor of monoamine oxidase (mao), an intracellular enzyme associated with the outer membrane of mitochondria. the purpose of this study is to establish a reliable and quick method for the assignment of apigenin in cosmos bipinnatus, apium graveolens and petroselinum crispum by high performance liquid chromatography with ultraviolet detection (hplc-u...

This paper gives a concise overview of evolutionary algorithms for multiobjective optimization. A substantial number of evolutionary computation methods for multiobjective problem solving has been proposed so far, and an attempt of unifying existing approaches is here presented. Based on a fine-grained decomposition and following the main issues of fitness assignment, diversity preservation and...