A trading halt is a measure conducted by a securities exchange in order to reduce information imbalances between market participants, thus enabling a higher level of market efficiency. A market is said to be efficient when new information concerning a company is instantly reflected in its stock price, implying that abnormal stock returns cannot be systematically achieved in an efficient market. The purpose of this study is to examine the occurrence of abnormal stock returns following trading halts on the Stockholm Stock Exchange. The study is based on a sample of 64 trading halts executed between January 2003 and February 2008. Historical daily prices for stocks subject to trading halts during the period have been gathered from the Datastream Advance database, while information on date and time of trading halts have been collected from the Stockholm Stock Exchange website.

Problems arise when the number of products in stock does not correspond with the number of products the information system says the company has in stock. (Sharda & Agrawal, 2012) In order to change that, major changes has to be made when it comes to making continuous improvements and to raise their standards regarding product availability and record inaccuracy (Wild, 2004).The purpose of this study is therefore designed to identify factors affecting the balance differences and what impact it has on the efficiency of material flow. The demarcation of the work is that Atlas Copco has begun working with Lean and it will not be investigated nor the relationship between balance differences and Lean. The study was based on answering the following questions: What influencing factors can be identified for balance differences? What factors are relevant to the efficiency of material flow? What kind of impact the balance differences has on these factors?In order to answer the purpose and issues, a theoretical framework has been developed with help of literature studies and an analytical model.

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 bachelor essay is divided into two parts, the first being a construction of a single-familyhouse and the second an in-depth study of five different isolation materials, analysed from anenergy perspective.The first part, the construction of the single-family house, has been created from knowledgeacquired during three years of studying at KTH Royal institute of Technology in Stockholm, inthe program Architecture and the Built Environment. The constructed house is a one-floorhouse of 137m2with façade plaster, situated in Borlänge, Sweden. The house has a wooden framewhich is built on a on sight cast concrete foundation, on the ground. The house?s roof is a gableroof, which has an angle of 24 degrees.

Lantmäteriet (the Swedish mapping, cadastral and land registration authority) has been laser scanning Sweden since 2009. From the laser scanned data a digital elevation model (DEM) in grid format, with a resolution of 2 m, is produced. This DEM is called GSD-Höjddata, grid 2+ and from its data and the laser point cloud itself (in the form of a las-file) contour lines can be extracted. Lantmäteriet has not yet done this, but plans to update the contour lines in their cartographic products exist. If this is to be done in a satisfactory way an evaluation of different methods for it is needed.

The global spread of the Internet has enabled busniesses and consumers in all industries to be better informed. Consequently, the buying process has appeared to become different from what tratditional models implies. As the buying behaviour among customers is evolving, selling companies are responding to this change. This thesis evolves around the consequences that the developing relationship between buyer and seller in business-to-business companies has led to. The topic in focus is the buzzword and phenomena "content marketing" with its marketing and selling strategy.

Cumulative effects are seldom treated in Swedish Environmental Impact Assessments (EIA). This report treats these questions and which procedures and methods that can be used when assessing cumulative effects in EIA. This report is a literature study where also a case study is a part. The case study shows how existing methods for cumulative effects can be used in practice. The report is concentrated on biology and treats cumulative effects on premises of biodiversity and roads. Cumulative effects include both direct and indirect effects.

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.

The purpose of this thesis is to investigate and analyze existing law concerning joint owner-ship in agriculture and forestry businesses. Joint ownership often arises through a succes-sion of ownership, therefore we will go through the most useful methods.Even if the owners of agriculture and forestry businesses are getting older, the numbers of succession of ownerships are still low. A succession of ownership is important to plan and its time is demanding. Often it takes three to five years for the completion of a succession of ownership. Therefore, owners must start their planning in time and think about what is to come of their business.