among numerous np-hard problems, the traveling salesman problem (tsp) has been one of the most explored, yet unknown one. even a minor modification changes the problem’s status, calling for a different solution. the generalized traveling salesman problem (gtsp)expands the tsp to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...

the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...

we present a matching and lp based heuristic algorithm that decides graph non-hamiltonicity. each of the n! hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices p, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. a graph instance (g) is initially coded as exclusion set ...

BACKGROUND Aprotinin appears to be more efficacious than lysine analogues to reduce bleeding and transfusion of blood products in high-transfusion-risk cardiac surgical patients. However, in isolated coronary artery bypass graft (CABG) surgery, the results from head-to-head trials remain less conclusive. OBJECTIVE Our objective was to compare the efficacies and safety of aprotinin and tranexa...

a total of 150 day old female chickens (ross 308) were randomly allocated to 2 groups with 5 replicate and 15 chicks in each replicate to determine the effects of cold induced ascites on performance, antioxidant status, blood enzyme activities and bone metabolism. the two experimental treatments were: 1) chicks that reared under normal temperature (nt) and 2) chicks that reared under cold tempe...

In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...