The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

This master´s thesis is a comparative study of the importance of eight factors suggested in the literature to be related to the perceived utility of the service Book a librarian (Swe. Boka en bibliotekarie). Disciplinary differences were also analysed. 73 encounters between students and librarians in 11 Swedish academic libraries were studied using a survey. Six factors were significantly related (at the .05 level) to the utility of the service.

This thesis studies the concept of balance in the management control systems (MCS) of a small Swedish company within the IT-sector. The aim is to evaluate the importance of balance and dynamics in MCS and investigate which factors affect them. The frameworks used are Simons (1994) four levers of control, and the five-factor model for balance and dynamics by Mundy (2010). The small IT company - the object of the case study - has grown extensively in the last years and needs to develop more formal MCS without losing efficiency and creativity in their fast-moving industry. The case study reveals that balancing MCS is important also in smaller companies with less formal MCS.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

This study is done on behalf of Södra skogsägarna in the autumn of 2012. The main purpose of the study is to get an explanation to why some of the members are passive in their forestry, and how Södra can stimulate them to become more active. To achieve this a questionnaire study was conducted on the members of Södra in the community of Gislaved. The result of the study shows that there are many different factors that influence whether the forest owner is active or not. Examples of those factors are timber prices, the forest owner's objectives and the forest owner's financial situation. The main goal for the forest owners in the survey was to obtain high economic result and to increase the standing timber volume for the next generation.

The aim for this master?s thesis is to investigate the indexing consistency in a folksonomy Delicious. This is done by investigating how users construct tags. By applying a semiotic perspective and use analysis of content the occurrences of inflected forms, hyponymy, meronymy and users own tag creations were established. Lancaster?s seven factors is the starting point for the discussion about indexing and the factors that affects it in either a negative or positive way.

Title: Nordea Life and Pension during financial crisis Subject: Business administration, Candidate thesis 15 p. Authors: Seyithan Öngörur och Adnan Yari Instructor: Peter Lindberg Date: 2010-01-13 Key words: Nordea, the financial crisis, advice, marketing, customer relationship Purpose: The purpose of the study is to provide an understanding of how the financial crisis has affected Nordea Life and Pensions market growth based on market share. We also want to give an understanding of what factors may be responsible for the outcome that it may be helpful in future financial crises. Method: A qualitative study was the basis for the study, where three interviews were carried out by the respondents from Nordea Life and Pension.  Theory: In this section we have focused on relevant theory and has divided them into different themes, advice, current legislation, marketing, consumption and buying behavior. Conclusion: The study shows that Nordea Life and Pension had a positive growth during the financial crisis and a number of factors are presented that may be the basis for the outcome.Proposal for further research: Since this study was limited to one company it may be intresting to investigate and examine the consuling industry market as a whole affected by the financial crisis. Contributions: This paper has provided an understanding of how Nordea Life and Pensions affected during a financial crisis, based on market share and the factors that may have been the basis for this..

Volunteering involves performing tasks without receiving any compensation for it. Interest in this idealistic commitment to non-profit organizations is growing and the primary reasons for this is to help other people, pursue their interests and contribute to the organization.The purpose of the study is to examine what it is that motivates individuals to commit to non-profit organizations. This study will only examine aid organizations. In order to answer the question four different theories have been used and these are the most fundamental theories in this field. These theories are Maslow's hierarchy of needs, Hertzberg's two-factor theory, Self-Determination Theory and The Gift.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.

The ability to tackle NP-hard problems has been greatly extended by the introduction of Metaheuristics (see Blum & Roli (2003)) for a summary of most Metaheuristics, general problem-independent optimisation algorithms extending the hill-climbing local search approach to escape local minima. One of these algorithms is Iterated Local Search (ILS) (Lourenco et al., 2002; Stützle, 1999a, p. 25ff), a recent easy to implement but powerful algorithm with results comparable or superior to other state-of-the-art methods for many combinatorial optimisation problems, among them the Traveling Salesman (TSP) and Quadratic Assignment Problem (QAP). ILS iteratively samples local minima by modifying the current local minimum and restartinga local search porcedure on this modified solution. This thesis will show how ILS can be implemented for MSA.