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

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

background: today’s nursing graduates value ability to creatively solve problems and make decisions, as these skills assist hem with recognizing and evaluating situations that require prompt attention. this study aimed to determine and compare nursing student’s perceived levels of own problem solving skills in various years of their 4-year program. methods: this is a cross-sectional study. all ...

aesthetics relates to felt meaning generated from sensory perceptions, and involves subjective, tacit knowledge rooted in feeling and emotion. we believe the aesthetics of management is important, but little understood, aspect of organizational life. we propose that followers use their aesthetic senses in making these assessments. in this article we try to discover the role of aesthetic in man...

teacher autonomy is viewed very differently: one teacher may view autonomy as a means to gain substantial freedom from interference or supervision; another may view it as the freedom to develop collegial relationships and accomplish tasks that extend beyond the classroom; and even some others may perceive it as a means for principals to avoid their duties (frase and sorenson, 1992). although th...

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

the sensitivity analysis for multi-attribute decision making (madm) problems is important for two reasons: first, the decision matrix as the source of the results of a decision problem is inaccurate because it sorts the alternatives in each criterion inaccurately. second, the decision maker may change his opinions in a time period because of changes in the importance of the criteria and in the ...