|
|
Company performance measurement by using Balanced Scorecard method
Navrátil, Šimon ; Pavláková Dočekalová, Marie (referee) ; Kocmanová, Alena (advisor)
This thesis focuses on the economic and financial evaluation of M&M Finance company s.r.o. using financial analysis and the Balanced Scorecard model. The first part of the thesis describes the methods and analyses used to evaluate the company's performance, with a focus on the Balanced Scorecard method as a key model. In the second part, these methods and analyses are applied to evaluate the performance of M&M Finance. The third part includes a proposal for implementing the Balanced Scorecard method in M&M Finance, which aims to improve the company's performance.
|
|
|
Company performance measurement by using Balanced Scorecard method
Navrátil, Šimon ; Pavláková Dočekalová, Marie (referee) ; Kocmanová, Alena (advisor)
This thesis focuses on the economic and financial evaluation of M&M Finance company s.r.o. using financial analysis and the Balanced Scorecard model. The first part of the thesis describes the methods and analyses used to evaluate the company's performance, with a focus on the Balanced Scorecard method as a key model. In the second part, these methods and analyses are applied to evaluate the performance of M&M Finance. The third part includes a proposal for implementing the Balanced Scorecard method in M&M Finance, which aims to improve the company's performance.
|
|
|
Polygon map navigation
Navrátil, Šimon ; Pangrác, Ondřej (advisor) ; Garajová, Elif (referee)
Finding the shortest path is a well-researched area for discrete problems. However, not all problems can be directly described by a graph, and in orienteering the runner can choose the path whichever way he wants, but he has to choose the fastest one just from the map. This is made more complicated by the different speed in different areas between the control points. In order to find the optimal path, a continuous solution has to be found. This work describes how to get a polygonal representation of a map from a map file and how to search the fastest path in it using two different approaches. 1
|
guest ::
