This essay is a study of the market strategies and situations in the telephone business. Our problem was to examine the telecom companies´ strategies to stay competitive and cope with the new VoIP technology. We chose to do a qualitative study and four telephone interviews were made with Swedish and Dutch companies. We investigated three different categories of companies in the market; industry leaders, cable companies and broadband companies to get a broad view of the market. The theory chapter is based on different strategies that companies have to or can apply to get ahead, stay or survive in a hypercompetition.

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.

Denna uppsats är behållningen av en fältstudie som har gjorts på ett företag inom transport- och logistikbranschen. Jag har använt mig av både primär (intervjuer) och sekundär data (hemsida, hållbarhetsrapport, företagstidning etc.) för att ta reda på hur företaget gör för att kunna konkurrera i branschen. Till de ämnen som genererats ur resultatet har teorier och modeller kopplats. Några av teorierna är Porters värdekedja, Normanns gemensamma värdeskapande och Abrahamssons m.fl. strategiska flexibilitet.

AbstractMotor sports have been around as long as motor vehicles have been. Sports are often seen as costly polluter but in the same time the motor sports have encourages a large part of development, both for vehicles and other industries. Inventions like rear mirror and ABS brakes come from motor sports. One way to once again drive development forward while making motor sports carbon-neutral is to run the race cars on hydrogen. In this thesis, the goal is to convert a spark ignition engine for hydrogen operation.

Racial discrimination is a highly topical and burning issue, of special interest in working life. Most researchers agree on that discrimination is a problem in the Swedish labour market. To counteract the ongoing discrimination, a new Anti-Discrimination Act was founded in 1999. The Racial Discrimination Act although appears to be ineffective on the basis of legal usage. Of all the legal cases about racial discrimination in the labour market, there has only been one sentence of guilty stated by the Swedish Labour Court.

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.

In recent time Hemnet has faced an intensified criticism because of the latest introduction of ad-fees, and not least because of the take-over regarding Swedbank Fastighetsbyrån and Svensk Fastighetsförmedling. There is a growing concern amongst real estate agents about the development for which the Swedish real estate advertising market is taking. Many of the competitors on the market that have previously experienced difficulties in establishing on the market now see their opportunity to make use of the situation that has emerged regarding Hemnet. By offering better and more lucrative terms they could potentially bring in enough real estate agencies to pose a real threat on the advertising market.Hemnet is part-owned by four organizations, Fastighetsbyrån, Svensk Fastighetsförmedling, Mäklarsamfundet and Fastighetsmäklarförbundet. All of which have a 25 percent share in Hemnet.

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.

In this thesis an explorative study was undertaken with the aim to study how a number of private care providers, as well as politicians and officials from councils in and around the Stockholm and Uppsala counties, think about the future of the Swedish elderly care from a property perspective, i.e. homes for the elderly. The analysis shows that there is a demand for capacity in 6 out of 16 municipalities, and that the property is an important part of this capacity, and the fulfillment of it. This was mainly due to the cost of capital, but also because of several other factors such as lack of land, a wish to guide the design, ideology, and in many cases a wish to use the property as an instrument of domination to control private health care providers.Also, the property was show to be connected to economic competition, to freedom of choice, and to quality. The problems related to the property in the market for elderly care still remains to be solved.

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.

To be able to compete on the market environmental Management System has become an important part of operations work. However, many companies still haven?t implemented an environmental management systems due to lack of time and the high costs. One of the companies with this problem is Falu Bildemontering. Their goal is to accredited according to the ISO 14 001 certificate.